Base | Representation |
---|---|
bin | 100110100100010111101… |
… | …0111000101110001111001 |
3 | 200202202020202200221011112 |
4 | 1031020233113011301321 |
5 | 1143322001230203101 |
6 | 15135051402210105 |
7 | 1054653242331110 |
oct | 115105727056171 |
9 | 20682222627145 |
10 | 5300784225401 |
11 | 176406055aa25 |
12 | 7173b1ab3935 |
13 | 2c5b28511972 |
14 | 1447b8b08c77 |
15 | 92d43b8d6bb |
hex | 4d22f5c5c79 |
5300784225401 has 8 divisors (see below), whose sum is σ = 6059583382464. Its totient is φ = 4542371135280.
The previous prime is 5300784225389. The next prime is 5300784225403. The reversal of 5300784225401 is 1045224870035.
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 5300784225401 - 230 = 5299710483577 is a prime.
It is a super-2 number, since 2×53007842254012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5300784225403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 96487310 + ... + 96542231.
It is an arithmetic number, because the mean of its divisors is an integer number (757447922808).
Almost surely, 25300784225401 is an apocalyptic number.
It is an amenable number.
5300784225401 is a deficient number, since it is larger than the sum of its proper divisors (758799157063).
5300784225401 is a wasteful number, since it uses less digits than its factorization.
5300784225401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193033471.
The product of its (nonzero) digits is 268800, while the sum is 41.
The spelling of 5300784225401 in words is "five trillion, three hundred billion, seven hundred eighty-four million, two hundred twenty-five thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •