Base | Representation |
---|---|
bin | 11101011001011110011… |
… | …11111011100110110101 |
3 | 10120120021022012122201000 |
4 | 32230233033323212311 |
5 | 113022201131120041 |
6 | 2052012123153513 |
7 | 132656316335034 |
oct | 16545717734665 |
9 | 3516238178630 |
10 | 1010110020021 |
11 | 35a426855643 |
12 | 143923975899 |
13 | 743399c74cb |
14 | 36c6504871b |
15 | 1b41e107bb6 |
hex | eb2f3fb9b5 |
1010110020021 has 16 divisors (see below), whose sum is σ = 1496891805120. Its totient is φ = 673212047760.
The previous prime is 1010110019999. The next prime is 1010110020047. The reversal of 1010110020021 is 1200200110101.
It is a happy number.
It is not a de Polignac number, because 1010110020021 - 26 = 1010110019957 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1010110019985 and 1010110020012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010110022021) 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, 5311275 + ... + 5498168.
It is an arithmetic number, because the mean of its divisors is an integer number (93555737820).
Almost surely, 21010110020021 is an apocalyptic number.
It is an amenable number.
1010110020021 is a deficient number, since it is larger than the sum of its proper divisors (486781785099).
1010110020021 is a wasteful number, since it uses less digits than its factorization.
1010110020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10812913 (or 10812907 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1010110020021 its reverse (1200200110101), we get a palindrome (2210310130122).
The spelling of 1010110020021 in words is "one trillion, ten billion, one hundred ten million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •