Base | Representation |
---|---|
bin | 1110001101111110011111… |
… | …10111001111111010011001 |
3 | 11002201001102221002100021201 |
4 | 13012333033313033322121 |
5 | 13044232400401030033 |
6 | 150255353505434201 |
7 | 6404635235416246 |
oct | 706771767177231 |
9 | 132631387070251 |
10 | 31266554314393 |
11 | 9a6508687a662 |
12 | 360b80193b961 |
13 | 145a567341078 |
14 | 7a1448a2a5cd |
15 | 3934ac84647d |
hex | 1c6fcfdcfe99 |
31266554314393 has 2 divisors, whose sum is σ = 31266554314394. Its totient is φ = 31266554314392.
The previous prime is 31266554314337. The next prime is 31266554314421. The reversal of 31266554314393 is 39341345566213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19810306069129 + 11456248245264 = 4450877^2 + 3384708^2 .
It is an emirp because it is prime and its reverse (39341345566213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 31266554314393 - 29 = 31266554313881 is a prime.
It is not a weakly prime, because it can be changed into another prime (31266554317393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15633277157196 + 15633277157197.
It is an arithmetic number, because the mean of its divisors is an integer number (15633277157197).
Almost surely, 231266554314393 is an apocalyptic number.
It is an amenable number.
31266554314393 is a deficient number, since it is larger than the sum of its proper divisors (1).
31266554314393 is an equidigital number, since it uses as much as digits as its factorization.
31266554314393 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 20995200, while the sum is 55.
The spelling of 31266554314393 in words is "thirty-one trillion, two hundred sixty-six billion, five hundred fifty-four million, three hundred fourteen thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •