Base | Representation |
---|---|
bin | 10001011101110010001… |
… | …101110100100001100100 |
3 | 11020201221211210222011012 |
4 | 101131302031310201210 |
5 | 124131013244214340 |
6 | 2315211514401352 |
7 | 152466242350646 |
oct | 21356215644144 |
9 | 4221854728135 |
10 | 1200212101220 |
11 | 423009494960 |
12 | 174738730258 |
13 | 8924451b0a2 |
14 | 4213a77a896 |
15 | 21348635565 |
hex | 11772374864 |
1200212101220 has 48 divisors (see below), whose sum is σ = 2844389822400. Its totient is φ = 421391080320.
The previous prime is 1200212101219. The next prime is 1200212101243. The reversal of 1200212101220 is 221012120021.
It is a junction number, because it is equal to n+sod(n) for n = 1200212101195 and 1200212101204.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94054130 + ... + 94066889.
It is an arithmetic number, because the mean of its divisors is an integer number (59258121300).
Almost surely, 21200212101220 is an apocalyptic number.
1200212101220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1200212101220 is an abundant number, since it is smaller than the sum of its proper divisors (1644177721180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200212101220 is a wasteful number, since it uses less digits than its factorization.
1200212101220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188121068 (or 188121066 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1200212101220 its reverse (221012120021), we get a palindrome (1421224221241).
The spelling of 1200212101220 in words is "one trillion, two hundred billion, two hundred twelve million, one hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •