Base | Representation |
---|---|
bin | 100110100100000011011… |
… | …1000000101101101110010 |
3 | 200202200111102122012211211 |
4 | 1031020012320011231302 |
5 | 1143314103340310114 |
6 | 15134500140230334 |
7 | 1054630354154302 |
oct | 115100670055562 |
9 | 20680442565754 |
10 | 5300105010034 |
11 | 176384211740a |
12 | 71724253b3aa |
13 | 2c5a4a89bb93 |
14 | 144752821602 |
15 | 92d042246c4 |
hex | 4d206e05b72 |
5300105010034 has 8 divisors (see below), whose sum is σ = 7953701952240. Its totient is φ = 2648871025956.
The previous prime is 5300105010019. The next prime is 5300105010037. The reversal of 5300105010034 is 4300105010035.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×53001050100342 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5300105009987 and 5300105010014.
It is not an unprimeable number, because it can be changed into a prime (5300105010037) 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 3 ways as a sum of consecutive naturals, for example, 590733924 + ... + 590742895.
It is an arithmetic number, because the mean of its divisors is an integer number (994212744030).
Almost surely, 25300105010034 is an apocalyptic number.
5300105010034 is a deficient number, since it is larger than the sum of its proper divisors (2653596942206).
5300105010034 is a wasteful number, since it uses less digits than its factorization.
5300105010034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1181479064.
The product of its (nonzero) digits is 900, while the sum is 22.
Subtracting from 5300105010034 its reverse (4300105010035), we obtain a palindrome (999999999999).
The spelling of 5300105010034 in words is "five trillion, three hundred billion, one hundred five million, ten thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •