Base | Representation |
---|---|
bin | 10111001100010010111001… |
… | …110100111010001100011100 |
3 | 111101011002211110001012021222 |
4 | 113030102321310322030130 |
5 | 101332132000224001340 |
6 | 1000534053101112512 |
7 | 30325154053144361 |
oct | 2714227164721434 |
9 | 441132743035258 |
10 | 102000001000220 |
11 | 2a555a59480494 |
12 | b534349b58738 |
13 | 44bb73596a65b |
14 | 1b28b7d882468 |
15 | bbd3c28e88b5 |
hex | 5cc4b9d3a31c |
102000001000220 has 12 divisors (see below), whose sum is σ = 214200002100504. Its totient is φ = 40800000400080.
The previous prime is 102000001000199. The next prime is 102000001000253. The reversal of 102000001000220 is 22000100000201.
It is a junction number, because it is equal to n+sod(n) for n = 102000001000198 and 102000001000207.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2550000024986 + ... + 2550000025025.
It is an arithmetic number, because the mean of its divisors is an integer number (17850000175042).
Almost surely, 2102000001000220 is an apocalyptic number.
102000001000220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102000001000220 is an abundant number, since it is smaller than the sum of its proper divisors (112200001100284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102000001000220 is a wasteful number, since it uses less digits than its factorization.
102000001000220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5100000050020 (or 5100000050018 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 102000001000220 its reverse (22000100000201), we get a palindrome (124000101000421).
The spelling of 102000001000220 in words is "one hundred two trillion, one million, two hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •