Base | Representation |
---|---|
bin | 1110001101111000100000… |
… | …10011101110000010011111 |
3 | 11002200202010221211022112221 |
4 | 13012330100103232002133 |
5 | 13044204310140133401 |
6 | 150254102543410211 |
7 | 6404462503040515 |
oct | 706742023560237 |
9 | 132622127738487 |
10 | 31263340552351 |
11 | 9a63787787676 |
12 | 360b0655b3967 |
13 | 145a17459451b |
14 | 7a1221c9c4b5 |
15 | 39337062a7a1 |
hex | 1c6f104ee09f |
31263340552351 has 2 divisors, whose sum is σ = 31263340552352. Its totient is φ = 31263340552350.
The previous prime is 31263340552261. The next prime is 31263340552361. The reversal of 31263340552351 is 15325504336213.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 31263340552351 - 211 = 31263340550303 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 31263340552298 and 31263340552307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (31263340552361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15631670276175 + 15631670276176.
It is an arithmetic number, because the mean of its divisors is an integer number (15631670276176).
Almost surely, 231263340552351 is an apocalyptic number.
31263340552351 is a deficient number, since it is larger than the sum of its proper divisors (1).
31263340552351 is an equidigital number, since it uses as much as digits as its factorization.
31263340552351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972000, while the sum is 43.
Adding to 31263340552351 its reverse (15325504336213), we get a palindrome (46588844888564).
The spelling of 31263340552351 in words is "thirty-one trillion, two hundred sixty-three billion, three hundred forty million, five hundred fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •