Base | Representation |
---|---|
bin | 1100111100011011011111… |
… | …0101111011100111111011 |
3 | 1212101121002020002112010101 |
4 | 3033012313311323213323 |
5 | 3331140233110120102 |
6 | 50134122230300231 |
7 | 2666151635423122 |
oct | 317066765734773 |
9 | 55347066075111 |
10 | 14232311020027 |
11 | 4597986598421 |
12 | 171a3981b7677 |
13 | 7c314136b289 |
14 | 372bc1894ab9 |
15 | 19a335ce7e87 |
hex | cf1b7d7b9fb |
14232311020027 has 2 divisors, whose sum is σ = 14232311020028. Its totient is φ = 14232311020026.
The previous prime is 14232311020021. The next prime is 14232311020033. The reversal of 14232311020027 is 72002011323241.
It is a balanced prime because it is at equal distance from previous prime (14232311020021) and next prime (14232311020033).
It is a cyclic number.
It is not a de Polignac number, because 14232311020027 - 215 = 14232310987259 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14232311019977 and 14232311020004.
It is not a weakly prime, because it can be changed into another prime (14232311020021) 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, 7116155510013 + 7116155510014.
It is an arithmetic number, because the mean of its divisors is an integer number (7116155510014).
Almost surely, 214232311020027 is an apocalyptic number.
14232311020027 is a deficient number, since it is larger than the sum of its proper divisors (1).
14232311020027 is an equidigital number, since it uses as much as digits as its factorization.
14232311020027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 14232311020027 its reverse (72002011323241), we get a palindrome (86234322343268).
The spelling of 14232311020027 in words is "fourteen trillion, two hundred thirty-two billion, three hundred eleven million, twenty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •