Base | Representation |
---|---|
bin | 10001011101110010001… |
… | …110001111000101100101 |
3 | 11020201221212000111101212 |
4 | 101131302032033011211 |
5 | 124131013311210041 |
6 | 2315211521001205 |
7 | 152466243313106 |
oct | 21356216170545 |
9 | 4221855014355 |
10 | 1200212210021 |
11 | 423009559680 |
12 | 174738783205 |
13 | 89244558776 |
14 | 4213a7a83ad |
15 | 213486578eb |
hex | 1177238f165 |
1200212210021 has 16 divisors (see below), whose sum is σ = 1310773017600. Its totient is φ = 1089893716800.
The previous prime is 1200212210009. The next prime is 1200212210069. The reversal of 1200212210021 is 1200122120021.
It is a cyclic number.
It is not a de Polignac number, because 1200212210021 - 210 = 1200212208997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1200212209978 and 1200212210005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1200212210081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54348860 + ... + 54370938.
It is an arithmetic number, because the mean of its divisors is an integer number (81923313600).
Almost surely, 21200212210021 is an apocalyptic number.
1200212210021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1200212210021 is a deficient number, since it is larger than the sum of its proper divisors (110560807579).
1200212210021 is a wasteful number, since it uses less digits than its factorization.
1200212210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27340.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1200212210021 its reverse (1200122120021), we get a palindrome (2400334330042).
The spelling of 1200212210021 in words is "one trillion, two hundred billion, two hundred twelve million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •