Base | Representation |
---|---|
bin | 1010111011010000000001… |
… | …1001111101001011100111 |
3 | 1120112102201201221111201102 |
4 | 2232310000121331023213 |
5 | 3033310141231043421 |
6 | 41314413203150315 |
7 | 2346625043005025 |
oct | 256640031751347 |
9 | 46472651844642 |
10 | 12013030331111 |
11 | 3911774496497 |
12 | 142025767539b |
13 | 691a93151194 |
14 | 2d76103a1715 |
15 | 15c746d6460b |
hex | aed0067d2e7 |
12013030331111 has 8 divisors (see below), whose sum is σ = 12669566295600. Its totient is φ = 11358921487680.
The previous prime is 12013030331077. The next prime is 12013030331231. The reversal of 12013030331111 is 11113303031021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12013030331111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12013030330111) by changing a digit.
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, 606770096 + ... + 606789893.
It is an arithmetic number, because the mean of its divisors is an integer number (1583695786950).
Almost surely, 212013030331111 is an apocalyptic number.
12013030331111 is a deficient number, since it is larger than the sum of its proper divisors (656535964489).
12013030331111 is a wasteful number, since it uses less digits than its factorization.
12013030331111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213560529.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 12013030331111 its reverse (11113303031021), we get a palindrome (23126333362132).
The spelling of 12013030331111 in words is "twelve trillion, thirteen billion, thirty million, three hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •