Base | Representation |
---|---|
bin | 10110111110000100010001… |
… | …100010011111000100000100 |
3 | 111020200122000012122000201021 |
4 | 112332010101202133010010 |
5 | 101220122001311201040 |
6 | 554504544525240524 |
7 | 30164420534024503 |
oct | 2676042142370404 |
9 | 436618005560637 |
10 | 101022220022020 |
11 | 2a209312616530 |
12 | b3b6949103144 |
13 | 444a47ba0b1bb |
14 | 1ad370431083a |
15 | ba2c46b2624a |
hex | 5be11189f104 |
101022220022020 has 48 divisors (see below), whose sum is σ = 241495014515328. Its totient is φ = 35138163484160.
The previous prime is 101022220021991. The next prime is 101022220022039. The reversal of 101022220022020 is 20220022220101.
It is a junction number, because it is equal to n+sod(n) for n = 101022220021985 and 101022220022003.
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, 9982427749 + ... + 9982437868.
It is an arithmetic number, because the mean of its divisors is an integer number (5031146135736).
Almost surely, 2101022220022020 is an apocalyptic number.
101022220022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101022220022020 is an abundant number, since it is smaller than the sum of its proper divisors (140472794493308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101022220022020 is a wasteful number, since it uses less digits than its factorization.
101022220022020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19964865660 (or 19964865658 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 101022220022020 its reverse (20220022220101), we get a palindrome (121242242242121).
The spelling of 101022220022020 in words is "one hundred one trillion, twenty-two billion, two hundred twenty million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •