Base | Representation |
---|---|
bin | 111011111010100… |
… | …101010101100111 |
3 | 2121001111010001021 |
4 | 323322211111213 |
5 | 4024313304111 |
6 | 243425112011 |
7 | 33624112144 |
oct | 7372452547 |
9 | 2531433037 |
10 | 1005213031 |
11 | 476464479 |
12 | 240788607 |
13 | 130343c14 |
14 | 977073cb |
15 | 5d3b0d71 |
hex | 3bea5567 |
1005213031 has 16 divisors (see below), whose sum is σ = 1102348800. Its totient is φ = 913291200.
The previous prime is 1005213029. The next prime is 1005213047. The reversal of 1005213031 is 1303125001.
It is a cyclic number.
It is not a de Polignac number, because 1005213031 - 21 = 1005213029 is a prime.
It is a super-2 number, since 2×10052130312 = 2020906475384413922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1005212996 and 1005213014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1005213731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35026 + ... + 56896.
It is an arithmetic number, because the mean of its divisors is an integer number (68896800).
Almost surely, 21005213031 is an apocalyptic number.
1005213031 is a deficient number, since it is larger than the sum of its proper divisors (97135769).
1005213031 is a wasteful number, since it uses less digits than its factorization.
1005213031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21990.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1005213031 is about 31705.0947167801. The cubic root of 1005213031 is about 1001.7346661933.
Adding to 1005213031 its reverse (1303125001), we get a palindrome (2308338032).
The spelling of 1005213031 in words is "one billion, five million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •