Base | Representation |
---|---|
bin | 11101000111001110011… |
… | …11111010001100110001 |
3 | 10112121222110201202210020 |
4 | 32203213033322030301 |
5 | 112342114400320423 |
6 | 2043312000154053 |
7 | 132161444505135 |
oct | 16434717721461 |
9 | 3477873652706 |
10 | 1000312120113 |
11 | 3562591283a9 |
12 | 141a4a608929 |
13 | 73437b4b1b7 |
14 | 365b5a933c5 |
15 | 1b048d6b4e3 |
hex | e8e73fa331 |
1000312120113 has 8 divisors (see below), whose sum is σ = 1339573728000. Its totient is φ = 663962629488.
The previous prime is 1000312120079. The next prime is 1000312120139. The reversal of 1000312120113 is 3110212130001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1000312120113 - 214 = 1000312103729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1000312120092 and 1000312120101.
It is not an unprimeable number, because it can be changed into a prime (1000312121113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 728028513 + ... + 728029886.
It is an arithmetic number, because the mean of its divisors is an integer number (167446716000).
Almost surely, 21000312120113 is an apocalyptic number.
It is an amenable number.
1000312120113 is a deficient number, since it is larger than the sum of its proper divisors (339261607887).
1000312120113 is a wasteful number, since it uses less digits than its factorization.
1000312120113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1456058631.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1000312120113 its reverse (3110212130001), we get a palindrome (4110524250114).
The spelling of 1000312120113 in words is "one trillion, three hundred twelve million, one hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •