Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …111010001100110110111100 |
3 | 111020121201100202011102022112 |
4 | 112331301220322030312330 |
5 | 101214310012010121340 |
6 | 554451435235033152 |
7 | 30163111642226336 |
oct | 2675615072146674 |
9 | 436551322142275 |
10 | 101002211020220 |
11 | 2a200884aa9304 |
12 | b3b2aa413b7b8 |
13 | 4448610501173 |
14 | 1ad2766b64456 |
15 | ba24751cd065 |
hex | 5bdc68e8cdbc |
101002211020220 has 24 divisors (see below), whose sum is σ = 221326584149664. Its totient is φ = 38644324216256.
The previous prime is 101002211020181. The next prime is 101002211020283. The reversal of 101002211020220 is 22020112200101.
It is a junction number, because it is equal to n+sod(n) for n = 101002211020195 and 101002211020204.
It is a congruent number.
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, 109785011519 + ... + 109785012438.
It is an arithmetic number, because the mean of its divisors is an integer number (9221941006236).
Almost surely, 2101002211020220 is an apocalyptic number.
101002211020220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101002211020220 is an abundant number, since it is smaller than the sum of its proper divisors (120324373129444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002211020220 is a wasteful number, since it uses less digits than its factorization.
101002211020220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 219570023989 (or 219570023987 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 101002211020220 its reverse (22020112200101), we get a palindrome (123022323220321).
The spelling of 101002211020220 in words is "one hundred one trillion, two billion, two hundred eleven million, twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •