Base | Representation |
---|---|
bin | 10111001111011001100011… |
… | …100111100011001000011110 |
3 | 111101220111101211102121101210 |
4 | 113033121203213203020132 |
5 | 101344130321033201420 |
6 | 1001220050531445250 |
7 | 30346444635336330 |
oct | 2717314347431036 |
9 | 441814354377353 |
10 | 102213303022110 |
11 | 2a628466951605 |
12 | b569758456826 |
13 | 4505899ab66a7 |
14 | 1b3521646b450 |
15 | bc3c08a7c9e0 |
hex | 5cf6639e321e |
102213303022110 has 64 divisors (see below), whose sum is σ = 286321519982592. Its totient is φ = 22865954716416.
The previous prime is 102213303021943. The next prime is 102213303022111. The reversal of 102213303022110 is 11220303312201.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102213303022111) 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, 5177969007 + ... + 5177988746.
It is an arithmetic number, because the mean of its divisors is an integer number (4473773749728).
Almost surely, 2102213303022110 is an apocalyptic number.
102213303022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102213303022110 is an abundant number, since it is smaller than the sum of its proper divisors (184108216960482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102213303022110 is a wasteful number, since it uses less digits than its factorization.
102213303022110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10355957817.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 102213303022110 its reverse (11220303312201), we get a palindrome (113433606334311).
The spelling of 102213303022110 in words is "one hundred two trillion, two hundred thirteen billion, three hundred three million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •