Base | Representation |
---|---|
bin | 10111001101110001001011… |
… | …000001010101010100111010 |
3 | 111101111210002122201011121221 |
4 | 113031301023001111110322 |
5 | 101340311300111414320 |
6 | 1001052353053222254 |
7 | 30335366304515230 |
oct | 2715611301252472 |
9 | 441453078634557 |
10 | 102101221201210 |
11 | 2a59498065a660 |
12 | b54ba9849198a |
13 | 44c81471c52ca |
14 | 1b2da229b0950 |
15 | bc0d48d0e3aa |
hex | 5cdc4b05553a |
102101221201210 has 512 divisors, whose sum is σ = 237676664365056. Its totient is φ = 30668544000000.
The previous prime is 102101221201207. The next prime is 102101221201249. The reversal of 102101221201210 is 12102122101201.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 255 ways as a sum of consecutive naturals, for example, 195222220009 + ... + 195222220531.
It is an arithmetic number, because the mean of its divisors is an integer number (464212235088).
Almost surely, 2102101221201210 is an apocalyptic number.
102101221201210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102101221201210 is an abundant number, since it is smaller than the sum of its proper divisors (135575443163846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102101221201210 is a wasteful number, since it uses less digits than its factorization.
102101221201210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1110.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102101221201210 its reverse (12102122101201), we get a palindrome (114203343302411).
It can be divided in two parts, 1021012 and 21201210, that added together give a palindrome (22222222).
The spelling of 102101221201210 in words is "one hundred two trillion, one hundred one billion, two hundred twenty-one million, two hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •