Base | Representation |
---|---|
bin | 11101011001011110101… |
… | …00011110001000100101 |
3 | 10120120021101110010002002 |
4 | 32230233110132020211 |
5 | 113022201432210041 |
6 | 2052012204455045 |
7 | 132656332422314 |
oct | 16545724361045 |
9 | 3516241403062 |
10 | 1010111210021 |
11 | 35a427498711 |
12 | 14392424a485 |
13 | 7433a023054 |
14 | 36c6527827b |
15 | 1b41e29059b |
hex | eb2f51e225 |
1010111210021 has 16 divisors (see below), whose sum is σ = 1049866272000. Its totient is φ = 971090467200.
The previous prime is 1010111209981. The next prime is 1010111210023. The reversal of 1010111210021 is 1200121110101.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010111210021 is a prime.
It is a super-2 number, since 2×10101112100212 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1010111209984 and 1010111210011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010111210023) 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, 5584520 + ... + 5762558.
It is an arithmetic number, because the mean of its divisors is an integer number (65616642000).
Almost surely, 21010111210021 is an apocalyptic number.
It is an amenable number.
1010111210021 is a deficient number, since it is larger than the sum of its proper divisors (39755061979).
1010111210021 is a wasteful number, since it uses less digits than its factorization.
1010111210021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180100.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1010111210021 its reverse (1200121110101), we get a palindrome (2210232320122).
The spelling of 1010111210021 in words is "one trillion, ten billion, one hundred eleven million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •