Base | Representation |
---|---|
bin | 111100010100011… |
… | …110100100000111 |
3 | 2121112020222102200 |
4 | 330110132210013 |
5 | 4033033013111 |
6 | 244230405543 |
7 | 34035603216 |
oct | 7424364407 |
9 | 2545228380 |
10 | 1012001031 |
11 | 47a280398 |
12 | 242b008b3 |
13 | 13187c7a2 |
14 | 9859307d |
15 | 5dca2256 |
hex | 3c51e907 |
1012001031 has 12 divisors (see below), whose sum is σ = 1483597752. Its totient is φ = 664597296.
The previous prime is 1012001021. The next prime is 1012001033. The reversal of 1012001031 is 1301002101.
1012001031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1012001031 - 25 = 1012000999 is a prime.
It is a super-2 number, since 2×10120010312 = 2048292173490125922, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012001033) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 838536 + ... + 839741.
It is an arithmetic number, because the mean of its divisors is an integer number (123633146).
Almost surely, 21012001031 is an apocalyptic number.
1012001031 is a deficient number, since it is larger than the sum of its proper divisors (471596721).
1012001031 is a wasteful number, since it uses less digits than its factorization.
1012001031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1678350 (or 1678347 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1012001031 is about 31811.9636457733. The cubic root of 1012001031 is about 1003.9844467652.
Adding to 1012001031 its reverse (1301002101), we get a palindrome (2313003132).
The spelling of 1012001031 in words is "one billion, twelve million, one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •