Base | Representation |
---|---|
bin | 11101000110110110101… |
… | …01101101001111110011 |
3 | 10112121110112202112102001 |
4 | 32203123111231033303 |
5 | 112341212223011311 |
6 | 2043240101434431 |
7 | 132153500254105 |
oct | 16433325551763 |
9 | 3477415675361 |
10 | 1000112313331 |
11 | 35616636762a |
12 | 1419b370ba17 |
13 | 73405630b31 |
14 | 36597321575 |
15 | 1b03654e4c1 |
hex | e8db56d3f3 |
1000112313331 has 4 divisors (see below), whose sum is σ = 1000959149664. Its totient is φ = 999265477000.
The previous prime is 1000112313323. The next prime is 1000112313341. The reversal of 1000112313331 is 1333132110001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1000112313331 - 23 = 1000112313323 is a prime.
It is a super-2 number, since 2×10001123133312 (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 = 1000112313299 and 1000112313308.
It is not an unprimeable number, because it can be changed into a prime (1000112313341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 423416395 + ... + 423418756.
It is an arithmetic number, because the mean of its divisors is an integer number (250239787416).
Almost surely, 21000112313331 is an apocalyptic number.
1000112313331 is a deficient number, since it is larger than the sum of its proper divisors (846836333).
1000112313331 is an equidigital number, since it uses as much as digits as its factorization.
1000112313331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 846836332.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1000112313331 its reverse (1333132110001), we get a palindrome (2333244423332).
The spelling of 1000112313331 in words is "one trillion, one hundred twelve million, three hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •