Base | Representation |
---|---|
bin | 1010111010100000101101… |
… | …1011001011101110001100 |
3 | 1120111012221122121002121220 |
4 | 2232220023123023232030 |
5 | 3033103134024102200 |
6 | 41304513045323340 |
7 | 2345665241351106 |
oct | 256501333135614 |
9 | 46435848532556 |
10 | 12000330300300 |
11 | 3907347674361 |
12 | 14198b2406550 |
13 | 69081ac69254 |
14 | 2d6b677dc576 |
15 | 15c251e174a0 |
hex | aea0b6cbb8c |
12000330300300 has 72 divisors (see below), whose sum is σ = 34921654985616. Its totient is φ = 3181590447360.
The previous prime is 12000330300269. The next prime is 12000330300323. The reversal of 12000330300300 is 300303300021.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 12000330300300.
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 23 ways as a sum of consecutive naturals, for example, 115558219 + ... + 115662018.
Almost surely, 212000330300300 is an apocalyptic number.
12000330300300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12000330300300 is an abundant number, since it is smaller than the sum of its proper divisors (22921324685316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000330300300 is a wasteful number, since it uses less digits than its factorization.
12000330300300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231220427 (or 231220420 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 15.
Adding to 12000330300300 its reverse (300303300021), we get a palindrome (12300633600321).
The spelling of 12000330300300 in words is "twelve trillion, three hundred thirty million, three hundred thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •