Base | Representation |
---|---|
bin | 100101001011101101110… |
… | …1110000111100111001101 |
3 | 200002112211201201220110111 |
4 | 1022113123232013213031 |
5 | 1132212101004240203 |
6 | 14511404135240021 |
7 | 1035133351543255 |
oct | 112273356074715 |
9 | 20075751656414 |
10 | 5110402415053 |
11 | 16a0344a31aa1 |
12 | 6a651b519011 |
13 | 2b0ba7a69a90 |
14 | 1394b819c965 |
15 | 8cdeed0826d |
hex | 4a5dbb879cd |
5110402415053 has 8 divisors (see below), whose sum is σ = 5539957383296. Its totient is φ = 4686054174000.
The previous prime is 5110402415047. The next prime is 5110402415089. The reversal of 5110402415053 is 3505142040115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5110402415053 - 213 = 5110402406861 is a prime.
It is a super-2 number, since 2×51104024150532 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5110402415023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1301679753 + ... + 1301683678.
It is an arithmetic number, because the mean of its divisors is an integer number (692494672912).
Almost surely, 25110402415053 is an apocalyptic number.
It is an amenable number.
5110402415053 is a deficient number, since it is larger than the sum of its proper divisors (429554968243).
5110402415053 is a wasteful number, since it uses less digits than its factorization.
5110402415053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2603363595.
The product of its (nonzero) digits is 12000, while the sum is 31.
Adding to 5110402415053 its reverse (3505142040115), we get a palindrome (8615544455168).
The spelling of 5110402415053 in words is "five trillion, one hundred ten billion, four hundred two million, four hundred fifteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •