Base | Representation |
---|---|
bin | 100101001101100101111… |
… | …1111100001101010100101 |
3 | 200002221020122221202020022 |
4 | 1022123023333201222211 |
5 | 1132243324434310203 |
6 | 14513312135444525 |
7 | 1035335300355650 |
oct | 112331377415245 |
9 | 20087218852208 |
10 | 5114433510053 |
11 | 16a202342436a |
12 | 6a7265526745 |
13 | 2b139ac579aa |
14 | 13977b6c8897 |
15 | 8d088b71a38 |
hex | 4a6cbfe1aa5 |
5114433510053 has 16 divisors (see below), whose sum is σ = 5987858446080. Its totient is φ = 4276714646400.
The previous prime is 5114433510047. The next prime is 5114433510059. The reversal of 5114433510053 is 3500153344115.
It is an interprime number because it is at equal distance from previous prime (5114433510047) and next prime (5114433510059).
It is not a de Polignac number, because 5114433510053 - 216 = 5114433444517 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5114433509995 and 5114433510022.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5114433510059) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7490483 + ... + 8144703.
It is an arithmetic number, because the mean of its divisors is an integer number (374241152880).
Almost surely, 25114433510053 is an apocalyptic number.
It is an amenable number.
5114433510053 is a deficient number, since it is larger than the sum of its proper divisors (873424936027).
5114433510053 is a wasteful number, since it uses less digits than its factorization.
5114433510053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681508.
The product of its (nonzero) digits is 54000, while the sum is 35.
Adding to 5114433510053 its reverse (3500153344115), we get a palindrome (8614586854168).
The spelling of 5114433510053 in words is "five trillion, one hundred fourteen billion, four hundred thirty-three million, five hundred ten thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •