Base | Representation |
---|---|
bin | 10111001101111010011110… |
… | …011010011000011011000010 |
3 | 111101112201212210210110000212 |
4 | 113031322132122120123002 |
5 | 101340442224303223020 |
6 | 1001101124204314122 |
7 | 30336201656634620 |
oct | 2715723632303302 |
9 | 441481783713025 |
10 | 102111210211010 |
11 | 2a599137148560 |
12 | b551a05842942 |
13 | 44c90798352b0 |
14 | 1b302cd4b2510 |
15 | bc1230c4acc5 |
hex | 5cde9e6986c2 |
102111210211010 has 128 divisors (see below), whose sum is σ = 250256444755968. Its totient is φ = 28964865888000.
The previous prime is 102111210210943. The next prime is 102111210211097. The reversal of 102111210211010 is 10112012111201.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 71126756 + ... + 72548175.
It is an arithmetic number, because the mean of its divisors is an integer number (1955128474656).
Almost surely, 2102111210211010 is an apocalyptic number.
102111210211010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102111210211010 is an abundant number, since it is smaller than the sum of its proper divisors (148145234544958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111210211010 is a wasteful number, since it uses less digits than its factorization.
102111210211010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143675040.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102111210211010 its reverse (10112012111201), we get a palindrome (112223222322211).
The spelling of 102111210211010 in words is "one hundred two trillion, one hundred eleven billion, two hundred ten million, two hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •