Base | Representation |
---|---|
bin | 100100101000010000000… |
… | …0110000010000010000101 |
3 | 122211021020211221121002101 |
4 | 1021100200012002002011 |
5 | 1124440110432414023 |
6 | 14412410433112101 |
7 | 1026466110001513 |
oct | 111204006020205 |
9 | 18737224847071 |
10 | 5034240123013 |
11 | 1671011341792 |
12 | 6938049b8631 |
13 | 2a695aa4289a |
14 | 135930dad4b3 |
15 | 8ae437031ad |
hex | 49420182085 |
5034240123013 has 8 divisors (see below), whose sum is σ = 5175400308480. Its totient is φ = 4894498633200.
The previous prime is 5034240123007. The next prime is 5034240123041. The reversal of 5034240123013 is 3103210424305.
It is a happy number.
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 5034240123013 - 225 = 5034206568581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5034240123413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 354666718 + ... + 354680911.
It is an arithmetic number, because the mean of its divisors is an integer number (646925038560).
Almost surely, 25034240123013 is an apocalyptic number.
It is an amenable number.
5034240123013 is a deficient number, since it is larger than the sum of its proper divisors (141160185467).
5034240123013 is a wasteful number, since it uses less digits than its factorization.
5034240123013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709347827.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 5034240123013 its reverse (3103210424305), we get a palindrome (8137450547318).
The spelling of 5034240123013 in words is "five trillion, thirty-four billion, two hundred forty million, one hundred twenty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •