Base | Representation |
---|---|
bin | 100100110001100011001… |
… | …1011000001100001110011 |
3 | 122220011210121202112001101 |
4 | 1021203012123001201303 |
5 | 1130302010342404021 |
6 | 14425512223545231 |
7 | 1031104022343052 |
oct | 111430633014163 |
9 | 18804717675041 |
10 | 5054210513011 |
11 | 167952a087330 |
12 | 697658a5b217 |
13 | 2a87c1250bba |
14 | 1368a7388399 |
15 | 8b711a70a91 |
hex | 498c66c1873 |
5054210513011 has 8 divisors (see below), whose sum is σ = 5513771865024. Its totient is φ = 4594663772520.
The previous prime is 5054210513003. The next prime is 5054210513047. The reversal of 5054210513011 is 1103150124505.
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 5054210513011 - 23 = 5054210513003 is a prime.
It is a super-2 number, since 2×50542105130112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5054210513081) 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 7 ways as a sum of consecutive naturals, for example, 2923281 + ... + 4319026.
It is an arithmetic number, because the mean of its divisors is an integer number (689221483128).
Almost surely, 25054210513011 is an apocalyptic number.
5054210513011 is a deficient number, since it is larger than the sum of its proper divisors (459561352013).
5054210513011 is a wasteful number, since it uses less digits than its factorization.
5054210513011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7305761.
The product of its (nonzero) digits is 3000, while the sum is 28.
Adding to 5054210513011 its reverse (1103150124505), we get a palindrome (6157360637516).
The spelling of 5054210513011 in words is "five trillion, fifty-four billion, two hundred ten million, five hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •