Base | Representation |
---|---|
bin | 10000001001110001001… |
… | …110100010101110011111 |
3 | 10221010002220002100222201 |
4 | 100021301032202232133 |
5 | 121141240301400111 |
6 | 2205532201552331 |
7 | 143123602345063 |
oct | 20116116425637 |
9 | 3833086070881 |
10 | 1110001200031 |
11 | 398826815669 |
12 | 15b1611a56a7 |
13 | 80898ac5a09 |
14 | 3ba1d85daa3 |
15 | 1dd189e96c1 |
hex | 102713a2b9f |
1110001200031 has 8 divisors (see below), whose sum is σ = 1113009408000. Its totient is φ = 1106993565912.
The previous prime is 1110001200017. The next prime is 1110001200047. The reversal of 1110001200031 is 1300021000111.
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 1110001200031 - 211 = 1110001197983 is a prime.
It is a super-2 number, since 2×11100012000312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110001199990 and 1110001200017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110001200431) 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, 3883096 + ... + 4159138.
It is an arithmetic number, because the mean of its divisors is an integer number (139126176000).
Almost surely, 21110001200031 is an apocalyptic number.
1110001200031 is a deficient number, since it is larger than the sum of its proper divisors (3008207969).
1110001200031 is a wasteful number, since it uses less digits than its factorization.
1110001200031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 286925.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 1110001200031 its reverse (1300021000111), we get a palindrome (2410022200142).
The spelling of 1110001200031 in words is "one trillion, one hundred ten billion, one million, two hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •