Base | Representation |
---|---|
bin | 100100101011000110001… |
… | …0001110110111110000110 |
3 | 122211212000200000010001110 |
4 | 1021112030101312332012 |
5 | 1130040114113130204 |
6 | 14415301015505450 |
7 | 1030103401131231 |
oct | 111261421667606 |
9 | 18755020003043 |
10 | 5040350130054 |
11 | 1673667279488 |
12 | 694a2b088286 |
13 | 2a73c2846c75 |
14 | 135d50656418 |
15 | 8b19ed1a889 |
hex | 4958c476f86 |
5040350130054 has 8 divisors (see below), whose sum is σ = 10080700260120. Its totient is φ = 1680116710016.
The previous prime is 5040350130019. The next prime is 5040350130059. The reversal of 5040350130054 is 4500310530405.
It is a sphenic number, since it is the product of 3 distinct primes.
5040350130054 is an admirable number.
It is a super-3 number, since 3×50403501300543 (a number of 39 digits) contains 333 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5040350130059) 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, 420029177499 + ... + 420029177510.
It is an arithmetic number, because the mean of its divisors is an integer number (1260087532515).
Almost surely, 25040350130054 is an apocalyptic number.
5040350130054 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5040350130054 is a wasteful number, since it uses less digits than its factorization.
5040350130054 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840058355014.
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 5040350130054 its reverse (4500310530405), we get a palindrome (9540660660459).
The spelling of 5040350130054 in words is "five trillion, forty billion, three hundred fifty million, one hundred thirty thousand, fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •