Base | Representation |
---|---|
bin | 100110100101001000100… |
… | …1011101011001100111010 |
3 | 200202220111010212020122110 |
4 | 1031022101023223030322 |
5 | 1143333331400300442 |
6 | 15135522310233150 |
7 | 1055042021151054 |
oct | 115122113531472 |
9 | 20686433766573 |
10 | 5302425400122 |
11 | 17648229a4874 |
12 | 71778b6557b6 |
13 | 2c602a532b76 |
14 | 1448d2a7a8d4 |
15 | 92ddccc269c |
hex | 4d2912eb33a |
5302425400122 has 8 divisors (see below), whose sum is σ = 10604850800256. Its totient is φ = 1767475133372.
The previous prime is 5302425400117. The next prime is 5302425400123. The reversal of 5302425400122 is 2210045242035.
It is a sphenic number, since it is the product of 3 distinct primes.
5302425400122 is an admirable number.
It is a super-2 number, since 2×53024254001222 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5302425400122.
It is not an unprimeable number, because it can be changed into a prime (5302425400123) 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, 441868783338 + ... + 441868783349.
It is an arithmetic number, because the mean of its divisors is an integer number (1325606350032).
Almost surely, 25302425400122 is an apocalyptic number.
5302425400122 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5302425400122 is a wasteful number, since it uses less digits than its factorization.
5302425400122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 883737566692.
The product of its (nonzero) digits is 19200, while the sum is 30.
The spelling of 5302425400122 in words is "five trillion, three hundred two billion, four hundred twenty-five million, four hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •