Base | Representation |
---|---|
bin | 100101010110100010000… |
… | …0011001001010101110101 |
3 | 200011202210100000020122002 |
4 | 1022231010003021111311 |
5 | 1133102132131002401 |
6 | 14530204515345045 |
7 | 1036615035366446 |
oct | 112550403112565 |
9 | 20152710006562 |
10 | 5133627594101 |
11 | 16aa182a41846 |
12 | 6aab215b2185 |
13 | 2b313968aa86 |
14 | 13a67c9452cd |
15 | 8d80dc97a6b |
hex | 4ab440c9575 |
5133627594101 has 2 divisors, whose sum is σ = 5133627594102. Its totient is φ = 5133627594100.
The previous prime is 5133627594097. The next prime is 5133627594113. The reversal of 5133627594101 is 1014957263315.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5133627594001 + 100 = 2265751^2 + 10^2 .
It is a cyclic number.
It is not a de Polignac number, because 5133627594101 - 22 = 5133627594097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5133627594301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2566813797050 + 2566813797051.
It is an arithmetic number, because the mean of its divisors is an integer number (2566813797051).
Almost surely, 25133627594101 is an apocalyptic number.
It is an amenable number.
5133627594101 is a deficient number, since it is larger than the sum of its proper divisors (1).
5133627594101 is an equidigital number, since it uses as much as digits as its factorization.
5133627594101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 680400, while the sum is 47.
The spelling of 5133627594101 in words is "five trillion, one hundred thirty-three billion, six hundred twenty-seven million, five hundred ninety-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •