Base | Representation |
---|---|
bin | 11101000001100010… |
… | …001010100001100001 |
3 | 2222102220000201210112 |
4 | 131001202022201201 |
5 | 1002311021333423 |
6 | 22152221541105 |
7 | 2152164502250 |
oct | 350142124141 |
9 | 88386021715 |
10 | 31164246113 |
11 | 1224244a400 |
12 | 6058a14795 |
13 | 2c2864b620 |
14 | 1718d0c797 |
15 | c25e50a78 |
hex | 74188a861 |
31164246113 has 96 divisors (see below), whose sum is σ = 43201498368. Its totient is φ = 21869844480.
The previous prime is 31164246109. The next prime is 31164246163.
It is a happy number.
31164246113 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 31164246113 - 22 = 31164246109 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31164246113.
It is not an unprimeable number, because it can be changed into a prime (31164246103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 110120870 + ... + 110121152.
It is an arithmetic number, because the mean of its divisors is an integer number (450015608).
Almost surely, 231164246113 is an apocalyptic number.
It is an amenable number.
31164246113 is a deficient number, since it is larger than the sum of its proper divisors (12037252255).
31164246113 is a wasteful number, since it uses less digits than its factorization.
31164246113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 535 (or 524 counting only the distinct ones).
The product of its digits is 10368, while the sum is 32.
The spelling of 31164246113 in words is "thirty-one billion, one hundred sixty-four million, two hundred forty-six thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •