Base | Representation |
---|---|
bin | 100011011110111100000111… |
… | …1010111101110001011100011 |
3 | 1111221002221202000111122122202 |
4 | 1012331320033113232023203 |
5 | 311402200102001331102 |
6 | 3023451521242323415 |
7 | 122512413553242122 |
oct | 10675701727561343 |
9 | 1457087660448582 |
10 | 312115531277027 |
11 | 904a44a9630765 |
12 | 2b00a0b7ab956b |
13 | 105204a323658a |
14 | 5710688073ab9 |
15 | 2613c94273e02 |
hex | 11bde0f5ee2e3 |
312115531277027 has 2 divisors, whose sum is σ = 312115531277028. Its totient is φ = 312115531277026.
The previous prime is 312115531276973. The next prime is 312115531277041. The reversal of 312115531277027 is 720772135511213.
It is a strong prime.
It is an emirp because it is prime and its reverse (720772135511213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 312115531277027 - 28 = 312115531276771 is a prime.
It is a super-2 number, since 2×3121155312770272 (a number of 30 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (312115531277057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156057765638513 + 156057765638514.
It is an arithmetic number, because the mean of its divisors is an integer number (156057765638514).
Almost surely, 2312115531277027 is an apocalyptic number.
312115531277027 is a deficient number, since it is larger than the sum of its proper divisors (1).
312115531277027 is an equidigital number, since it uses as much as digits as its factorization.
312115531277027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 617400, while the sum is 47.
The spelling of 312115531277027 in words is "three hundred twelve trillion, one hundred fifteen billion, five hundred thirty-one million, two hundred seventy-seven thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •