Base | Representation |
---|---|
bin | 100101001011101110011… |
… | …1100101010010010010111 |
3 | 200002112220011110221121121 |
4 | 1022113130330222102113 |
5 | 1132212121242114221 |
6 | 14511410152424411 |
7 | 1035134021545252 |
oct | 112273474522227 |
9 | 20075804427547 |
10 | 5110423004311 |
11 | 16a0355615009 |
12 | 6a65263a8107 |
13 | 2b0bac0c8481 |
14 | 1394babdc099 |
15 | 8ce01a23a41 |
hex | 4a5dcf2a497 |
5110423004311 has 2 divisors, whose sum is σ = 5110423004312. Its totient is φ = 5110423004310.
The previous prime is 5110423004293. The next prime is 5110423004329. The reversal of 5110423004311 is 1134003240115.
It is a balanced prime because it is at equal distance from previous prime (5110423004293) and next prime (5110423004329).
It is a cyclic number.
It is not a de Polignac number, because 5110423004311 - 217 = 5110422873239 is a prime.
It is a super-2 number, since 2×51104230043112 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5110423004111) 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, 2555211502155 + 2555211502156.
It is an arithmetic number, because the mean of its divisors is an integer number (2555211502156).
Almost surely, 25110423004311 is an apocalyptic number.
5110423004311 is a deficient number, since it is larger than the sum of its proper divisors (1).
5110423004311 is an equidigital number, since it uses as much as digits as its factorization.
5110423004311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 5110423004311 its reverse (1134003240115), we get a palindrome (6244426244426).
The spelling of 5110423004311 in words is "five trillion, one hundred ten billion, four hundred twenty-three million, four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •