Base | Representation |
---|---|
bin | 11101011100111111111… |
… | …10101010110001011111 |
3 | 10120202011010000122120112 |
4 | 32232133332222301133 |
5 | 113040034314220111 |
6 | 2052523524240235 |
7 | 133054223201162 |
oct | 16563776526137 |
9 | 3522133018515 |
10 | 1012001320031 |
11 | 3602073a92a9 |
12 | 14417124007b |
13 | 7457b7a3140 |
14 | 36da42c9ad9 |
15 | 1b4d0197e8b |
hex | eb9ffaac5f |
1012001320031 has 8 divisors (see below), whose sum is σ = 1095324199200. Its totient is φ = 929460815712.
The previous prime is 1012001320009. The next prime is 1012001320069. The reversal of 1012001320031 is 1300231002101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1012001320031 - 238 = 737123413087 is a prime.
It is a super-2 number, since 2×10120013200312 (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 = 1012001319988 and 1012001320015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012001320081) 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, 195591020 + ... + 195596193.
It is an arithmetic number, because the mean of its divisors is an integer number (136915524900).
Almost surely, 21012001320031 is an apocalyptic number.
1012001320031 is a deficient number, since it is larger than the sum of its proper divisors (83322879169).
1012001320031 is a wasteful number, since it uses less digits than its factorization.
1012001320031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 391187425.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1012001320031 its reverse (1300231002101), we get a palindrome (2312232322132).
The spelling of 1012001320031 in words is "one trillion, twelve billion, one million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •