Base | Representation |
---|---|
bin | 11101001111101010… |
… | …101100010000101101 |
3 | 10000001102012111022002 |
4 | 131033222230100231 |
5 | 1003302222044402 |
6 | 22231532102045 |
7 | 2161104114512 |
oct | 351752542055 |
9 | 100042174262 |
10 | 31401362477 |
11 | 12354283441 |
12 | 6104304925 |
13 | 2c657cca74 |
14 | 173c5d3309 |
15 | c3bb8c602 |
hex | 74faac42d |
31401362477 has 2 divisors, whose sum is σ = 31401362478. Its totient is φ = 31401362476.
The previous prime is 31401362459. The next prime is 31401362561. The reversal of 31401362477 is 77426310413.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17866599556 + 13534762921 = 133666^2 + 116339^2 .
It is an emirp because it is prime and its reverse (77426310413) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31401362477 - 212 = 31401358381 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 31401362477.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31401362977) 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, 15700681238 + 15700681239.
It is an arithmetic number, because the mean of its divisors is an integer number (15700681239).
Almost surely, 231401362477 is an apocalyptic number.
It is an amenable number.
31401362477 is a deficient number, since it is larger than the sum of its proper divisors (1).
31401362477 is an equidigital number, since it uses as much as digits as its factorization.
31401362477 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84672, while the sum is 38.
The spelling of 31401362477 in words is "thirty-one billion, four hundred one million, three hundred sixty-two thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •