Base | Representation |
---|---|
bin | 1011000110001001010010… |
… | …1110000011010111011101 |
3 | 1121012022212001212200101022 |
4 | 2301202110232003113131 |
5 | 3044342003232033041 |
6 | 41540410122253525 |
7 | 2366302245554123 |
oct | 261422456032735 |
9 | 47168761780338 |
10 | 12200202221021 |
11 | 3984093105711 |
12 | 14505930572a5 |
13 | 6a6621892c69 |
14 | 3026c889d913 |
15 | 16254dedc24b |
hex | b1894b835dd |
12200202221021 has 16 divisors (see below), whose sum is σ = 13221135865344. Its totient is φ = 11228243940144.
The previous prime is 12200202221017. The next prime is 12200202221023. The reversal of 12200202221021 is 12012220200221.
It is a happy number.
12200202221021 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 12200202221021 - 22 = 12200202221017 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12200202221023) 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, 91992671 + ... + 92125196.
It is an arithmetic number, because the mean of its divisors is an integer number (826320991584).
Almost surely, 212200202221021 is an apocalyptic number.
It is an amenable number.
12200202221021 is a deficient number, since it is larger than the sum of its proper divisors (1020933644323).
12200202221021 is a wasteful number, since it uses less digits than its factorization.
12200202221021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184118000.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 12200202221021 its reverse (12012220200221), we get a palindrome (24212422421242).
The spelling of 12200202221021 in words is "twelve trillion, two hundred billion, two hundred two million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •