Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …111010001001101011000010 |
3 | 111101111200020100121001002020 |
4 | 113031300020322021223002 |
5 | 101340302012134202320 |
6 | 1001052051031502310 |
7 | 30335326645612221 |
oct | 2715601072115302 |
9 | 441450210531066 |
10 | 102100112022210 |
11 | 2a594461545aa5 |
12 | b54b828b27996 |
13 | 44c7ccb47c683 |
14 | 1b2d959562cb8 |
15 | bc0cd1763940 |
hex | 5cdc08e89ac2 |
102100112022210 has 16 divisors (see below), whose sum is σ = 245040268853376. Its totient is φ = 27226696539248.
The previous prime is 102100112022193. The next prime is 102100112022247. The reversal of 102100112022210 is 12220211001201.
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 102100112022210.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1701668533674 + ... + 1701668533733.
It is an arithmetic number, because the mean of its divisors is an integer number (15315016803336).
Almost surely, 2102100112022210 is an apocalyptic number.
102100112022210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100112022210 is an abundant number, since it is smaller than the sum of its proper divisors (142940156831166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100112022210 is a wasteful number, since it uses less digits than its factorization.
102100112022210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3403337067417.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102100112022210 its reverse (12220211001201), we get a palindrome (114320323023411).
The spelling of 102100112022210 in words is "one hundred two trillion, one hundred billion, one hundred twelve million, twenty-two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •