Base | Representation |
---|---|
bin | 10110111110000010010011… |
… | …010011101101110011010010 |
3 | 111020200102112121121120212211 |
4 | 112332002103103231303102 |
5 | 101220103132132033020 |
6 | 554503554433342334 |
7 | 30164314210020520 |
oct | 2676022323556322 |
9 | 436612477546784 |
10 | 101020102221010 |
11 | 2a20842612a265 |
12 | b3b6457a079aa |
13 | 444a202029acb |
14 | 1ad3582d4d310 |
15 | ba2b70c4485a |
hex | 5be0934edcd2 |
101020102221010 has 32 divisors (see below), whose sum is σ = 211335032257920. Its totient is φ = 34048421860992.
The previous prime is 101020102220977. The next prime is 101020102221019. The reversal of 101020102221010 is 10122201020101.
It is a super-2 number, since 2×1010201022210102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101020102221019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12230032459 + ... + 12230040718.
It is an arithmetic number, because the mean of its divisors is an integer number (6604219758060).
Almost surely, 2101020102221010 is an apocalyptic number.
101020102221010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101020102221010 is an abundant number, since it is smaller than the sum of its proper divisors (110314930036910).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101020102221010 is a wasteful number, since it uses less digits than its factorization.
101020102221010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24460073250.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101020102221010 its reverse (10122201020101), we get a palindrome (111142303241111).
The spelling of 101020102221010 in words is "one hundred one trillion, twenty billion, one hundred two million, two hundred twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •