Base | Representation |
---|---|
bin | 100110101000101011000… |
… | …1010110010101001111001 |
3 | 200210122002210022111010211 |
4 | 1031101112022302221321 |
5 | 1143444412430403403 |
6 | 15143220353311121 |
7 | 1055431242612061 |
oct | 115212612625171 |
9 | 20718083274124 |
10 | 5310025247353 |
11 | 1767a72902552 |
12 | 7191508654a1 |
13 | 2c696bbacca8 |
14 | 1450141403a1 |
15 | 931d50c906d |
hex | 4d4562b2a79 |
5310025247353 has 4 divisors (see below), whose sum is σ = 5310042451200. Its totient is φ = 5310008043508.
The previous prime is 5310025247309. The next prime is 5310025247369. The reversal of 5310025247353 is 3537425200135.
It is a happy number.
5310025247353 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5310025247353 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5310025247753) 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, 8130325 + ... + 8759122.
It is an arithmetic number, because the mean of its divisors is an integer number (1327510612800).
Almost surely, 25310025247353 is an apocalyptic number.
It is an amenable number.
5310025247353 is a deficient number, since it is larger than the sum of its proper divisors (17203847).
5310025247353 is a wasteful number, since it uses less digits than its factorization.
5310025247353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17203846.
The product of its (nonzero) digits is 378000, while the sum is 40.
The spelling of 5310025247353 in words is "five trillion, three hundred ten billion, twenty-five million, two hundred forty-seven thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •