Base | Representation |
---|---|
bin | 10110111100110100… |
… | …00010011000110110 |
3 | 1011210200200222221010 |
4 | 23132122002120312 |
5 | 200213223131240 |
6 | 5354344133050 |
7 | 614222224320 |
oct | 133632023066 |
9 | 34720628833 |
10 | 12321302070 |
11 | 5253065680 |
12 | 247a467186 |
13 | 12148b05ac |
14 | 84c578610 |
15 | 4c1a8b280 |
hex | 2de682636 |
12321302070 has 64 divisors (see below), whose sum is σ = 36867902976. Its totient is φ = 2560270080.
The previous prime is 12321302057. The next prime is 12321302107. The reversal of 12321302070 is 7020312321.
12321302070 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2664639 + ... + 2669258.
It is an arithmetic number, because the mean of its divisors is an integer number (576060984).
Almost surely, 212321302070 is an apocalyptic number.
12321302070 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12321302070 is an abundant number, since it is smaller than the sum of its proper divisors (24546600906).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12321302070 is a wasteful number, since it uses less digits than its factorization.
12321302070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5333925.
The product of its (nonzero) digits is 504, while the sum is 21.
Adding to 12321302070 its reverse (7020312321), we get a palindrome (19341614391).
The spelling of 12321302070 in words is "twelve billion, three hundred twenty-one million, three hundred two thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •