Base | Representation |
---|---|
bin | 10111001101110000001111… |
… | …010110111001101010010100 |
3 | 111101111200111220012011102120 |
4 | 113031300033112321222110 |
5 | 101340302222334101400 |
6 | 1001052105454535540 |
7 | 30335332431365622 |
oct | 2715601726715224 |
9 | 441450456164376 |
10 | 102100220222100 |
11 | 2a5945076281a1 |
12 | b54b8592075b0 |
13 | 44c8017a04589 |
14 | 1b2d969a8a512 |
15 | bc0cdaed7ca0 |
hex | 5cdc0f5b9a94 |
102100220222100 has 72 divisors (see below), whose sum is σ = 295425362712480. Its totient is φ = 27225306756480.
The previous prime is 102100220222083. The next prime is 102100220222191. The reversal of 102100220222100 is 1222022001201.
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 102100220222100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3092970 + ... + 14620769.
Almost surely, 2102100220222100 is an apocalyptic number.
102100220222100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102100220222100 is an abundant number, since it is smaller than the sum of its proper divisors (193325142490380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100220222100 is a wasteful number, since it uses less digits than its factorization.
102100220222100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17732969 (or 17732962 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102100220222100 its reverse (1222022001201), we get a palindrome (103322242223301).
The spelling of 102100220222100 in words is "one hundred two trillion, one hundred billion, two hundred twenty million, two hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •