Base | Representation |
---|---|
bin | 10111001100010100110111… |
… | …101001110100011001011110 |
3 | 111101011022021120022012220220 |
4 | 113030110313221310121132 |
5 | 101332200311134201420 |
6 | 1000535042351422210 |
7 | 30325260265425216 |
oct | 2714246751643136 |
9 | 441138246265826 |
10 | 102002112022110 |
11 | 2a556942057483 |
12 | b534838b24966 |
13 | 44bb9b1117231 |
14 | 1b28cddd9b246 |
15 | bbd497ddb840 |
hex | 5cc537a7465e |
102002112022110 has 32 divisors (see below), whose sum is σ = 257689546162560. Its totient is φ = 25768954615968.
The previous prime is 102002112022087. The next prime is 102002112022141. The reversal of 102002112022110 is 11220211200201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 102002112022110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 89475536292 + ... + 89475537431.
It is an arithmetic number, because the mean of its divisors is an integer number (8052798317580).
Almost surely, 2102002112022110 is an apocalyptic number.
102002112022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102002112022110 is an abundant number, since it is smaller than the sum of its proper divisors (155687434140450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102002112022110 is a wasteful number, since it uses less digits than its factorization.
102002112022110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178951073752.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102002112022110 its reverse (11220211200201), we get a palindrome (113222323222311).
The spelling of 102002112022110 in words is "one hundred two trillion, two billion, one hundred twelve million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •