Base | Representation |
---|---|
bin | 110000111001… |
… | …001010000111 |
3 | 220010011122212 |
4 | 300321022013 |
5 | 11240121111 |
6 | 1134414035 |
7 | 213641303 |
oct | 60711207 |
9 | 26104585 |
10 | 12817031 |
11 | 7264697 |
12 | 436131b |
13 | 2869b56 |
14 | 19b8d03 |
15 | 11d298b |
hex | c39287 |
12817031 has 8 divisors (see below), whose sum is σ = 13663584. Its totient is φ = 11980800.
The previous prime is 12817027. The next prime is 12817069. The reversal of 12817031 is 13071821.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12817031 - 22 = 12817027 is a prime.
It is a super-2 number, since 2×128170312 = 328552567309922, 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 = 12816988 and 12817006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12817081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 71 + ... + 5063.
It is an arithmetic number, because the mean of its divisors is an integer number (1707948).
Almost surely, 212817031 is an apocalyptic number.
12817031 is a deficient number, since it is larger than the sum of its proper divisors (846553).
12817031 is a wasteful number, since it uses less digits than its factorization.
12817031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5161.
The product of its (nonzero) digits is 336, while the sum is 23.
The square root of 12817031 is about 3580.0881274069. The cubic root of 12817031 is about 234.0251208816.
Adding to 12817031 its reverse (13071821), we get a palindrome (25888852).
The spelling of 12817031 in words is "twelve million, eight hundred seventeen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •