Base | Representation |
---|---|
bin | 10110111100110100… |
… | …00111010001110101 |
3 | 1011210200202000102000 |
4 | 23132122013101311 |
5 | 200213224301401 |
6 | 5354344405513 |
7 | 614222336604 |
oct | 133632072165 |
9 | 34720660360 |
10 | 12321322101 |
11 | 5253079730 |
12 | 247a476899 |
13 | 12148b974a |
14 | 84c581a3b |
15 | 4c1a92186 |
hex | 2de687475 |
12321322101 has 64 divisors (see below), whose sum is σ = 21282600960. Its totient is φ = 6962215680.
The previous prime is 12321322087. The next prime is 12321322109. The reversal of 12321322101 is 10122312321.
12321322101 is a `hidden beast` number, since 12 + 321 + 322 + 10 + 1 = 666.
It is not a de Polignac number, because 12321322101 - 29 = 12321321589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12321322109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 528840 + ... + 551646.
It is an arithmetic number, because the mean of its divisors is an integer number (332540640).
Almost surely, 212321322101 is an apocalyptic number.
12321322101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
12321322101 is a deficient number, since it is larger than the sum of its proper divisors (8961278859).
12321322101 is a wasteful number, since it uses less digits than its factorization.
12321322101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22951 (or 22945 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12321322101 its reverse (10122312321), we get a palindrome (22443634422).
The spelling of 12321322101 in words is "twelve billion, three hundred twenty-one million, three hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •