Base | Representation |
---|---|
bin | 100100101011000100111… |
… | …1010011001011001000001 |
3 | 122211211220220021220011120 |
4 | 1021112021322121121001 |
5 | 1130040023432101103 |
6 | 14415253040502453 |
7 | 1030102406502423 |
oct | 111261172313101 |
9 | 18754826256146 |
10 | 5040310425153 |
11 | 167364691a613 |
12 | 694a1991aa29 |
13 | 2a73b7554843 |
14 | 135d4927c813 |
15 | 8b19b5c6253 |
hex | 49589e99641 |
5040310425153 has 16 divisors (see below), whose sum is σ = 6850524041280. Its totient is φ = 3295213173824.
The previous prime is 5040310425119. The next prime is 5040310425191. The reversal of 5040310425153 is 3515240130405.
It is a cyclic number.
It is not a de Polignac number, because 5040310425153 - 213 = 5040310416961 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5040310425053) 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 15 ways as a sum of consecutive naturals, for example, 7331751 + ... + 7989692.
It is an arithmetic number, because the mean of its divisors is an integer number (428157752580).
Almost surely, 25040310425153 is an apocalyptic number.
5040310425153 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
5040310425153 is a deficient number, since it is larger than the sum of its proper divisors (1810213616127).
5040310425153 is a wasteful number, since it uses less digits than its factorization.
5040310425153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15323568.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 5040310425153 its reverse (3515240130405), we get a palindrome (8555550555558).
The spelling of 5040310425153 in words is "five trillion, forty billion, three hundred ten million, four hundred twenty-five thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •