Base | Representation |
---|---|
bin | 11101011101001101000… |
… | …01001001011111000101 |
3 | 10120202102202110002102012 |
4 | 32232212201021133011 |
5 | 113040300410201041 |
6 | 2052542443424005 |
7 | 133060024512101 |
oct | 16564641113705 |
9 | 3522382402365 |
10 | 1012111022021 |
11 | 360263317000 |
12 | 1441a1b25005 |
13 | 74598432968 |
14 | 36db4ac4901 |
15 | 1b4d9b173eb |
hex | eba68497c5 |
1012111022021 has 16 divisors (see below), whose sum is σ = 1171838011200. Its totient is φ = 871674542640.
The previous prime is 1012111021993. The next prime is 1012111022063. The reversal of 1012111022021 is 1202201112101.
It is not a de Polignac number, because 1012111022021 - 210 = 1012111020997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1012111021987 and 1012111022005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012111027021) 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, 19985606 + ... + 20036183.
It is an arithmetic number, because the mean of its divisors is an integer number (73239875700).
Almost surely, 21012111022021 is an apocalyptic number.
1012111022021 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012111022021 is a deficient number, since it is larger than the sum of its proper divisors (159726989179).
1012111022021 is an equidigital number, since it uses as much as digits as its factorization.
1012111022021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40021841 (or 40021819 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 1012111022021 its reverse (1202201112101), we get a palindrome (2214312134122).
The spelling of 1012111022021 in words is "one trillion, twelve billion, one hundred eleven million, twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •