Base | Representation |
---|---|
bin | 100100011101011111000… |
… | …0110111110000110101101 |
3 | 122202001120122221000201012 |
4 | 1020322332012332012231 |
5 | 1124100234032143141 |
6 | 14354024413555005 |
7 | 1025020154544053 |
oct | 110727606760655 |
9 | 18661518830635 |
10 | 5011121365421 |
11 | 1662228409a56 |
12 | 68b2324a5a65 |
13 | 2a47151a3172 |
14 | 13477a80a1d3 |
15 | 8a53dc85ceb |
hex | 48ebe1be1ad |
5011121365421 has 8 divisors (see below), whose sum is σ = 5306450614080. Its totient is φ = 4718950718688.
The previous prime is 5011121365417. The next prime is 5011121365447. The reversal of 5011121365421 is 1245631211105.
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 5011121365421 - 22 = 5011121365417 is a prime.
It is a super-2 number, since 2×50111213654212 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011121325421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 789647216 + ... + 789653561.
It is an arithmetic number, because the mean of its divisors is an integer number (663306326760).
Almost surely, 25011121365421 is an apocalyptic number.
It is an amenable number.
5011121365421 is a deficient number, since it is larger than the sum of its proper divisors (295329248659).
5011121365421 is a wasteful number, since it uses less digits than its factorization.
5011121365421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1579300963.
The product of its (nonzero) digits is 7200, while the sum is 32.
Adding to 5011121365421 its reverse (1245631211105), we get a palindrome (6256752576526).
The spelling of 5011121365421 in words is "five trillion, eleven billion, one hundred twenty-one million, three hundred sixty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •