Base | Representation |
---|---|
bin | 10110111110000011001001… |
… | …011011000010111011011100 |
3 | 111020200111212212222020111012 |
4 | 112332003021123002323130 |
5 | 101220112012042042340 |
6 | 554504224504514352 |
7 | 30164345542663622 |
oct | 2676031133027334 |
9 | 436614785866435 |
10 | 101021010112220 |
11 | 2a208851661380 |
12 | b3b666ba7b9b8 |
13 | 444a318157243 |
14 | 1ad362b761512 |
15 | ba2bc57ce565 |
hex | 5be0c96c2edc |
101021010112220 has 24 divisors (see below), whose sum is σ = 231429950439408. Its totient is φ = 36734912768000.
The previous prime is 101021010112181. The next prime is 101021010112249. The reversal of 101021010112220 is 22211010120101.
It is a junction number, because it is equal to n+sod(n) for n = 101021010112195 and 101021010112204.
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, 229593204581 + ... + 229593205020.
It is an arithmetic number, because the mean of its divisors is an integer number (9642914601642).
Almost surely, 2101021010112220 is an apocalyptic number.
101021010112220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101021010112220 is an abundant number, since it is smaller than the sum of its proper divisors (130408940327188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021010112220 is a wasteful number, since it uses less digits than its factorization.
101021010112220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 459186409621 (or 459186409619 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101021010112220 its reverse (22211010120101), we get a palindrome (123232020232321).
The spelling of 101021010112220 in words is "one hundred one trillion, twenty-one billion, ten million, one hundred twelve thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •