Base | Representation |
---|---|
bin | 10111001111001110001100… |
… | …111111010101011000100101 |
3 | 111101212022221020021202102202 |
4 | 113033032030333111120211 |
5 | 101343430334212034341 |
6 | 1001210313124344245 |
7 | 30345533556260636 |
oct | 2717161477253045 |
9 | 441768836252382 |
10 | 102201112221221 |
11 | 2a623280520452 |
12 | b567315845085 |
13 | 45046a6268a40 |
14 | 1b347bb38388d |
15 | bc37436bd79b |
hex | 5cf38cfd5625 |
102201112221221 has 16 divisors (see below), whose sum is σ = 110491029331200. Its totient is φ = 93972501355968.
The previous prime is 102201112221193. The next prime is 102201112221269. The reversal of 102201112221221 is 122122211102201.
It is a cyclic number.
It is not a de Polignac number, because 102201112221221 - 226 = 102201045112357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102201112221193 and 102201112221202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102201112221281) 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, 17680580 + ... + 22737746.
It is an arithmetic number, because the mean of its divisors is an integer number (6905689333200).
Almost surely, 2102201112221221 is an apocalyptic number.
It is an amenable number.
102201112221221 is a deficient number, since it is larger than the sum of its proper divisors (8289917109979).
102201112221221 is a wasteful number, since it uses less digits than its factorization.
102201112221221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5063228.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 102201112221221 its reverse (122122211102201), we get a palindrome (224323323323422).
The spelling of 102201112221221 in words is "one hundred two trillion, two hundred one billion, one hundred twelve million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •