Base | Representation |
---|---|
bin | 100101001001010101111… |
… | …0010100101011110110111 |
3 | 200002001200100212122111101 |
4 | 1022102223302211132313 |
5 | 1132121130121443221 |
6 | 14505202143550531 |
7 | 1034563114101436 |
oct | 112225362453667 |
9 | 20061610778441 |
10 | 5105303312311 |
11 | 16991686966a4 |
12 | 6a55378bb447 |
13 | 2b057451cc17 |
14 | 139152ca111d |
15 | 8cc02327d91 |
hex | 4a4abca57b7 |
5105303312311 has 4 divisors (see below), whose sum is σ = 5243284482952. Its totient is φ = 4967322141672.
The previous prime is 5105303312227. The next prime is 5105303312363. The reversal of 5105303312311 is 1132133035015.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5105303312311 - 215 = 5105303279543 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5105303312311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105303312411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68990585265 + ... + 68990585338.
It is an arithmetic number, because the mean of its divisors is an integer number (1310821120738).
Almost surely, 25105303312311 is an apocalyptic number.
5105303312311 is a deficient number, since it is larger than the sum of its proper divisors (137981170641).
5105303312311 is a wasteful number, since it uses less digits than its factorization.
5105303312311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137981170640.
The product of its (nonzero) digits is 4050, while the sum is 28.
Adding to 5105303312311 its reverse (1132133035015), we get a palindrome (6237436347326).
The spelling of 5105303312311 in words is "five trillion, one hundred five billion, three hundred three million, three hundred twelve thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •