Base | Representation |
---|---|
bin | 1011001011111101100011… |
… | …1001011011110000100011 |
3 | 1121112212210020012012200000 |
4 | 2302333120321123300203 |
5 | 3103011131324144021 |
6 | 42054334000031043 |
7 | 2406440460340125 |
oct | 262773071336043 |
9 | 47485706165600 |
10 | 12300130303011 |
11 | 3a1250198a741 |
12 | 1467a20902483 |
13 | 6b2b88511b65 |
14 | 30748815d215 |
15 | 164e4bc6cb26 |
hex | b2fd8e5bc23 |
12300130303011 has 24 divisors (see below), whose sum is σ = 18425087828784. Its totient is φ = 8199997286400.
The previous prime is 12300130302953. The next prime is 12300130303031. The reversal of 12300130303011 is 11030303100321.
It is a happy number.
12300130303011 is a `hidden beast` number, since 1 + 2 + 300 + 1 + 30 + 30 + 301 + 1 = 666.
It is not a de Polignac number, because 12300130303011 - 227 = 12299996085283 is a prime.
It is a super-2 number, since 2×123001303030112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (12300130303031) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27915211 + ... + 28352411.
It is an arithmetic number, because the mean of its divisors is an integer number (767711992866).
Almost surely, 212300130303011 is an apocalyptic number.
12300130303011 is a deficient number, since it is larger than the sum of its proper divisors (6124957525773).
12300130303011 is an equidigital number, since it uses as much as digits as its factorization.
12300130303011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552993 (or 552981 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 12300130303011 its reverse (11030303100321), we get a palindrome (23330433403332).
The spelling of 12300130303011 in words is "twelve trillion, three hundred billion, one hundred thirty million, three hundred three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •