Base | Representation |
---|---|
bin | 10110111110000011001111… |
… | …011000001010111101111010 |
3 | 111020200112010211222011221210 |
4 | 112332003033120022331322 |
5 | 101220112213131201020 |
6 | 554504242434143550 |
7 | 30164351165132043 |
oct | 2676031730127572 |
9 | 436615124864853 |
10 | 101021110022010 |
11 | 2a2088a2aa1052 |
12 | b3b6699421bb6 |
13 | 444a332a68969 |
14 | 1ad363ab2b8ca |
15 | ba2bce4673e0 |
hex | 5be0cf60af7a |
101021110022010 has 64 divisors (see below), whose sum is σ = 253085253712128. Its totient is φ = 25758205085184.
The previous prime is 101021110021981. The next prime is 101021110022039. The reversal of 101021110022010 is 10220011120101.
It is an interprime number because it is at equal distance from previous prime (101021110021981) and next prime (101021110022039).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25110597 + ... + 28854536.
It is an arithmetic number, because the mean of its divisors is an integer number (3954457089252).
Almost surely, 2101021110022010 is an apocalyptic number.
101021110022010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101021110022010 is an abundant number, since it is smaller than the sum of its proper divisors (152064143690118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021110022010 is a wasteful number, since it uses less digits than its factorization.
101021110022010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53967879.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101021110022010 its reverse (10220011120101), we get a palindrome (111241121142111).
The spelling of 101021110022010 in words is "one hundred one trillion, twenty-one billion, one hundred ten million, twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •