Base | Representation |
---|---|
bin | 10110101111100000111100… |
… | …111001001101110111011010 |
3 | 111010011000211111012120010020 |
4 | 112233200330321031313122 |
5 | 101102231001311134320 |
6 | 552421323514531310 |
7 | 30032236566203214 |
oct | 2657407471156732 |
9 | 433130744176106 |
10 | 100022220021210 |
11 | 2996320469aa73 |
12 | b274b87136b36 |
13 | 43a70937421a6 |
14 | 1a9b15bca75b4 |
15 | b86c1a3ae940 |
hex | 5af83ce4ddda |
100022220021210 has 32 divisors (see below), whose sum is σ = 240249610500480. Its totient is φ = 26650782844608.
The previous prime is 100022220021193. The next prime is 100022220021263. The reversal of 100022220021210 is 12120022220001.
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 100022220021210.
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, 1363035265 + ... + 1363108644.
It is an arithmetic number, because the mean of its divisors is an integer number (7507800328140).
Almost surely, 2100022220021210 is an apocalyptic number.
100022220021210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
100022220021210 is an abundant number, since it is smaller than the sum of its proper divisors (140227390479270).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100022220021210 is a wasteful number, since it uses less digits than its factorization.
100022220021210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2726145142.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 100022220021210 its reverse (12120022220001), we get a palindrome (112142242241211).
The spelling of 100022220021210 in words is "one hundred trillion, twenty-two billion, two hundred twenty million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •