Base | Representation |
---|---|
bin | 1010111011001001101100… |
… | …0100111001101101000110 |
3 | 1120112021100021001122022210 |
4 | 2232302123010321231012 |
5 | 3033243201030004110 |
6 | 41313532354004250 |
7 | 2346534651046056 |
oct | 256623304715506 |
9 | 46467307048283 |
10 | 12011330313030 |
11 | 3910a81910774 |
12 | 141ba62276686 |
13 | 691881b99619 |
14 | 2d74cc6b3566 |
15 | 15c6979aa520 |
hex | aec9b139b46 |
12011330313030 has 16 divisors (see below), whose sum is σ = 28827192751344. Its totient is φ = 3203021416800.
The previous prime is 12011330313023. The next prime is 12011330313049. The reversal of 12011330313030 is 3031303311021.
It is a junction number, because it is equal to n+sod(n) for n = 12011330312988 and 12011330313006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 200188838521 + ... + 200188838580.
It is an arithmetic number, because the mean of its divisors is an integer number (1801699546959).
Almost surely, 212011330313030 is an apocalyptic number.
12011330313030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12011330313030 is an abundant number, since it is smaller than the sum of its proper divisors (16815862438314).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011330313030 is a wasteful number, since it uses less digits than its factorization.
12011330313030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 400377677111.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 12011330313030 its reverse (3031303311021), we get a palindrome (15042633624051).
The spelling of 12011330313030 in words is "twelve trillion, eleven billion, three hundred thirty million, three hundred thirteen thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •