Base | Representation |
---|---|
bin | 100100101011000000001… |
… | …1110001001011111010001 |
3 | 122211211111212020100001202 |
4 | 1021112000132021133101 |
5 | 1130034212404300131 |
6 | 14415225221440545 |
7 | 1030065444225500 |
oct | 111260036113721 |
9 | 18754455210052 |
10 | 5040152025041 |
11 | 1673575470231 |
12 | 694994870155 |
13 | 2a73907a4373 |
14 | 135d32208837 |
15 | 8b18c737bcb |
hex | 495807897d1 |
5040152025041 has 48 divisors (see below), whose sum is σ = 6138049104000. Its totient is φ = 4118735884032.
The previous prime is 5040152024993. The next prime is 5040152025043. The reversal of 5040152025041 is 1405202510405.
It is not a de Polignac number, because 5040152025041 - 234 = 5022972155857 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5040152024995 and 5040152025013.
It is not an unprimeable number, because it can be changed into a prime (5040152025043) 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 in 47 ways as a sum of consecutive naturals, for example, 1084134485 + ... + 1084139133.
It is an arithmetic number, because the mean of its divisors is an integer number (127876023000).
Almost surely, 25040152025041 is an apocalyptic number.
It is an amenable number.
5040152025041 is a deficient number, since it is larger than the sum of its proper divisors (1097897078959).
5040152025041 is a wasteful number, since it uses less digits than its factorization.
5040152025041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7638 (or 7631 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 29.
Adding to 5040152025041 its reverse (1405202510405), we get a palindrome (6445354535446).
The spelling of 5040152025041 in words is "five trillion, forty billion, one hundred fifty-two million, twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •