Base | Representation |
---|---|
bin | 10000001001111101010… |
… | …101101100000110001101 |
3 | 10221010122001102222221222 |
4 | 100021331111230012031 |
5 | 121142144311300023 |
6 | 2210004301133125 |
7 | 143131620460622 |
oct | 20117525540615 |
9 | 3833561388858 |
10 | 1110204400013 |
11 | 398920493835 |
12 | 15b1b925a1a5 |
13 | 808cbc306a7 |
14 | 3ba3c836349 |
15 | 1dd2b786cc8 |
hex | 1027d56c18d |
1110204400013 has 16 divisors (see below), whose sum is σ = 1179973079040. Its totient is φ = 1041615903600.
The previous prime is 1110204400007. The next prime is 1110204400049. The reversal of 1110204400013 is 3100044020111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1110204400013 - 28 = 1110204399757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110204399964 and 1110204400000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110204406013) 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, 214328 + ... + 1505438.
It is an arithmetic number, because the mean of its divisors is an integer number (73748317440).
Almost surely, 21110204400013 is an apocalyptic number.
It is an amenable number.
1110204400013 is a deficient number, since it is larger than the sum of its proper divisors (69768679027).
1110204400013 is a wasteful number, since it uses less digits than its factorization.
1110204400013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1291568.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 1110204400013 its reverse (3100044020111), we get a palindrome (4210248420124).
The spelling of 1110204400013 in words is "one trillion, one hundred ten billion, two hundred four million, four hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •