Base | Representation |
---|---|
bin | 10000001001111101101… |
… | …111101010101100100101 |
3 | 10221010122112020222112111 |
4 | 100021331233222230211 |
5 | 121142203032210041 |
6 | 2210005103121021 |
7 | 143132032403104 |
oct | 20117557525445 |
9 | 3833575228474 |
10 | 1110211210021 |
11 | 398924315241 |
12 | 15b1bb5a3171 |
13 | 80900476294 |
14 | 3ba3d6ca03b |
15 | 1dd2c17e981 |
hex | 1027dbeab25 |
1110211210021 has 8 divisors (see below), whose sum is σ = 1113938622720. Its totient is φ = 1106488930272.
The previous prime is 1110211210019. The next prime is 1110211210037. The reversal of 1110211210021 is 1200121120111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1110211210021 - 21 = 1110211210019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110211209983 and 1110211210010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110211210001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 849685 + ... + 1715338.
It is an arithmetic number, because the mean of its divisors is an integer number (139242327840).
Almost surely, 21110211210021 is an apocalyptic number.
It is an amenable number.
1110211210021 is a deficient number, since it is larger than the sum of its proper divisors (3727412699).
1110211210021 is a wasteful number, since it uses less digits than its factorization.
1110211210021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2566475.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1110211210021 its reverse (1200121120111), we get a palindrome (2310332330132).
The spelling of 1110211210021 in words is "one trillion, one hundred ten billion, two hundred eleven million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •