Base | Representation |
---|---|
bin | 10000001001110001110… |
… | …100110011011101000101 |
3 | 10221010010120221221112211 |
4 | 100021301310303131011 |
5 | 121141300333330041 |
6 | 2205533200543421 |
7 | 143124053531041 |
oct | 20116164633505 |
9 | 3833116857484 |
10 | 1110011230021 |
11 | 398831446311 |
12 | 15b164621b71 |
13 | 8089abc8115 |
14 | 3ba20d11021 |
15 | 1dd1982b481 |
hex | 10271d33745 |
1110011230021 has 16 divisors (see below), whose sum is σ = 1162146498048. Its totient is φ = 1058200070400.
The previous prime is 1110011230007. The next prime is 1110011230049. The reversal of 1110011230021 is 1200321100111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1110011230021 - 213 = 1110011221829 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110011229983 and 1110011230010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110011230421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 50741716 + ... + 50763586.
It is an arithmetic number, because the mean of its divisors is an integer number (72634156128).
Almost surely, 21110011230021 is an apocalyptic number.
It is an amenable number.
1110011230021 is a deficient number, since it is larger than the sum of its proper divisors (52135268027).
1110011230021 is a wasteful number, since it uses less digits than its factorization.
1110011230021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29172.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 1110011230021 its reverse (1200321100111), we get a palindrome (2310332330132).
The spelling of 1110011230021 in words is "one trillion, one hundred ten billion, eleven million, two hundred thirty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •