Base | Representation |
---|---|
bin | 10111001111011001011111… |
… | …010101100100111110011001 |
3 | 111101220111012211021210000011 |
4 | 113033121133111210332121 |
5 | 101344130144141432301 |
6 | 1001220035444241521 |
7 | 30346443104023000 |
oct | 2717313725447631 |
9 | 441814184253004 |
10 | 102213231202201 |
11 | 2a62842a358209 |
12 | b5697383a02a1 |
13 | 4505887c5b6c2 |
14 | 1b3520aad3c37 |
15 | bc3c025e2a51 |
hex | 5cf65f564f99 |
102213231202201 has 32 divisors (see below), whose sum is σ = 121487807750400. Its totient is φ = 85930223154048.
The previous prime is 102213231202183. The next prime is 102213231202231. The reversal of 102213231202201 is 102202132312201.
It is not a de Polignac number, because 102213231202201 - 27 = 102213231202073 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102213231202231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54838365 + ... + 56671621.
It is an arithmetic number, because the mean of its divisors is an integer number (3796493992200).
Almost surely, 2102213231202201 is an apocalyptic number.
It is an amenable number.
102213231202201 is a deficient number, since it is larger than the sum of its proper divisors (19274576548199).
102213231202201 is an equidigital number, since it uses as much as digits as its factorization.
102213231202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1836398 (or 1836384 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 102213231202201 its reverse (102202132312201), we get a palindrome (204415363514402).
The spelling of 102213231202201 in words is "one hundred two trillion, two hundred thirteen billion, two hundred thirty-one million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •