Base | Representation |
---|---|
bin | 10001011101101100101… |
… | …111101000000111101100 |
3 | 11020201201110001222120110 |
4 | 101131230233220013230 |
5 | 124130321244100022 |
6 | 2315154435020020 |
7 | 152464046143644 |
oct | 21355457500754 |
9 | 4221643058513 |
10 | 1200120300012 |
11 | 422a71693297 |
12 | 174711a3a610 |
13 | 8922b4b834a |
14 | 4212c4c1524 |
15 | 2134055000c |
hex | 1176cbe81ec |
1200120300012 has 12 divisors (see below), whose sum is σ = 2800280700056. Its totient is φ = 400040100000.
The previous prime is 1200120299941. The next prime is 1200120300031. The reversal of 1200120300012 is 2100030210021.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 100010025001 = 1200120300012 / (1 + 2 + 0 + 0 + 1 + 2 + 0 + 3 + 0 + 0 + 0 + 1 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50005012489 + ... + 50005012512.
Almost surely, 21200120300012 is an apocalyptic number.
1200120300012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1200120300012 is an abundant number, since it is smaller than the sum of its proper divisors (1600160400044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200120300012 is a wasteful number, since it uses less digits than its factorization.
1200120300012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100010025008 (or 100010025006 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1200120300012 its reverse (2100030210021), we get a palindrome (3300150510033).
The spelling of 1200120300012 in words is "one trillion, two hundred billion, one hundred twenty million, three hundred thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •