Base | Representation |
---|---|
bin | 1011110110100001011000… |
… | …0000111100011011010111 |
3 | 1201010210001201012111012101 |
4 | 2331220112000330123113 |
5 | 3202001100312403302 |
6 | 43414255134502531 |
7 | 2513323523300344 |
oct | 275502600743327 |
9 | 51123051174171 |
10 | 13031300122327 |
11 | 41745a8214993 |
12 | 1565678064a47 |
13 | 736b004cc066 |
14 | 330a0adc37cb |
15 | 178e924c7287 |
hex | bda1603c6d7 |
13031300122327 has 2 divisors, whose sum is σ = 13031300122328. Its totient is φ = 13031300122326.
The previous prime is 13031300122319. The next prime is 13031300122381. The reversal of 13031300122327 is 72322100313031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 13031300122327 - 23 = 13031300122319 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13031300122295 and 13031300122304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13031300122307) 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, 6515650061163 + 6515650061164.
It is an arithmetic number, because the mean of its divisors is an integer number (6515650061164).
Almost surely, 213031300122327 is an apocalyptic number.
13031300122327 is a deficient number, since it is larger than the sum of its proper divisors (1).
13031300122327 is an equidigital number, since it uses as much as digits as its factorization.
13031300122327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 28.
Adding to 13031300122327 its reverse (72322100313031), we get a palindrome (85353400435358).
The spelling of 13031300122327 in words is "thirteen trillion, thirty-one billion, three hundred million, one hundred twenty-two thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •