Base | Representation |
---|---|
bin | 10111001111001110001101… |
… | …011101000101101011100101 |
3 | 111101212022221202222001000122 |
4 | 113033032031131011223211 |
5 | 101343430343211134341 |
6 | 1001210314003451325 |
7 | 30345534012465314 |
oct | 2717161535055345 |
9 | 441768852861018 |
10 | 102201120021221 |
11 | 2a623284968731 |
12 | b567318386b45 |
13 | 45046a7a6a120 |
14 | 1b347bc41427b |
15 | bc374420e94b |
hex | 5cf38d745ae5 |
102201120021221 has 32 divisors (see below), whose sum is σ = 112000869542016. Its totient is φ = 92685811680000.
The previous prime is 102201120021181. The next prime is 102201120021223. The reversal of 102201120021221 is 122120021102201.
It is a cyclic number.
It is not a de Polignac number, because 102201120021221 - 222 = 102201115826917 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102201120021221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102201120021223) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1441426871 + ... + 1441497771.
It is an arithmetic number, because the mean of its divisors is an integer number (3500027173188).
Almost surely, 2102201120021221 is an apocalyptic number.
It is an amenable number.
102201120021221 is a deficient number, since it is larger than the sum of its proper divisors (9799749520795).
102201120021221 is a wasteful number, since it uses less digits than its factorization.
102201120021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75333.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102201120021221 its reverse (122120021102201), we get a palindrome (224321141123422).
The spelling of 102201120021221 in words is "one hundred two trillion, two hundred one billion, one hundred twenty million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •