Base | Representation |
---|---|
bin | 11101010001000001… |
… | …110111111110000011 |
3 | 10000010000012121202112 |
4 | 131101001313332003 |
5 | 1003324044420323 |
6 | 22234110005535 |
7 | 2161502302616 |
oct | 352101677603 |
9 | 100100177675 |
10 | 31424216963 |
11 | 12366173347 |
12 | 610baa68ab |
13 | 2c6a472529 |
14 | 174166217d |
15 | c3dba4178 |
hex | 751077f83 |
31424216963 has 2 divisors, whose sum is σ = 31424216964. Its totient is φ = 31424216962.
The previous prime is 31424216911. The next prime is 31424217007. The reversal of 31424216963 is 36961242413.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31424216963 - 210 = 31424215939 is a prime.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31424216963.
It is not a weakly prime, because it can be changed into another prime (31424218963) 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 as a sum of consecutive naturals, namely, 15712108481 + 15712108482.
It is an arithmetic number, because the mean of its divisors is an integer number (15712108482).
Almost surely, 231424216963 is an apocalyptic number.
31424216963 is a deficient number, since it is larger than the sum of its proper divisors (1).
31424216963 is an equidigital number, since it uses as much as digits as its factorization.
31424216963 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 186624, while the sum is 41.
The spelling of 31424216963 in words is "thirty-one billion, four hundred twenty-four million, two hundred sixteen thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •