Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …010000000101011110101 |
3 | 10221010002210212000100100 |
4 | 100021301022000223311 |
5 | 121141240000341041 |
6 | 2205532120304313 |
7 | 143123556266355 |
oct | 20116112005365 |
9 | 3833083760310 |
10 | 1110000012021 |
11 | 39882608403a |
12 | 15b160912099 |
13 | 8089879b054 |
14 | 3ba1d630b65 |
15 | 1dd188626b6 |
hex | 10271280af5 |
1110000012021 has 48 divisors (see below), whose sum is σ = 1629066602800. Its totient is φ = 728221777920.
The previous prime is 1110000011971. The next prime is 1110000012089. The reversal of 1110000012021 is 1202100000111.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 747854825796 + 362145186225 = 864786^2 + 601785^2 .
It is not a de Polignac number, because 1110000012021 - 217 = 1109999880949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110000011994 and 1110000012012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110000012091) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 115033005 + ... + 115042653.
Almost surely, 21110000012021 is an apocalyptic number.
It is an amenable number.
1110000012021 is a deficient number, since it is larger than the sum of its proper divisors (519066590779).
1110000012021 is a wasteful number, since it uses less digits than its factorization.
1110000012021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10486 (or 10483 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1110000012021 its reverse (1202100000111), we get a palindrome (2312100012132).
The spelling of 1110000012021 in words is "one trillion, one hundred ten billion, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •