Base | Representation |
---|---|
bin | 10110111110000011001111… |
… | …011000001010111110000100 |
3 | 111020200112010211222011222011 |
4 | 112332003033120022332010 |
5 | 101220112213131201040 |
6 | 554504242434144004 |
7 | 30164351165132056 |
oct | 2676031730127604 |
9 | 436615124864864 |
10 | 101021110022020 |
11 | 2a2088a2aa1061 |
12 | b3b6699422004 |
13 | 444a332a68976 |
14 | 1ad363ab2b8d6 |
15 | ba2bce4673ea |
hex | 5be0cf60af84 |
101021110022020 has 24 divisors (see below), whose sum is σ = 212226145397784. Its totient is φ = 40392860322816.
The previous prime is 101021110021981. The next prime is 101021110022039. The reversal of 101021110022020 is 20220011120101.
It can be written as a sum of positive squares in 4 ways, for example, as 10288450624 + 101010821571396 = 101432^2 + 10050414^2 .
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, 973927219 + ... + 974030938.
It is an arithmetic number, because the mean of its divisors is an integer number (8842756058241).
Almost surely, 2101021110022020 is an apocalyptic number.
101021110022020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101021110022020 is an abundant number, since it is smaller than the sum of its proper divisors (111205035375764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101021110022020 is a wasteful number, since it uses less digits than its factorization.
101021110022020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1947960759 (or 1947960757 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101021110022020 its reverse (20220011120101), we get a palindrome (121241121142121).
The spelling of 101021110022020 in words is "one hundred one trillion, twenty-one billion, one hundred ten million, twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •