Base | Representation |
---|---|
bin | 100111000010110100010… |
… | …1010111111010110110001 |
3 | 201000000000122001021102002 |
4 | 1032011220222333112301 |
5 | 1200404404041041341 |
6 | 15225103511503345 |
7 | 1062456462361265 |
oct | 116055052772661 |
9 | 21000018037362 |
10 | 5366170252721 |
11 | 1789864237033 |
12 | 727bbb687b55 |
13 | 2cc048a89165 |
14 | 147a1ca280a5 |
15 | 948be19b29b |
hex | 4e168abf5b1 |
5366170252721 has 8 divisors (see below), whose sum is σ = 5372327474400. Its totient is φ = 5360016130560.
The previous prime is 5366170252711. The next prime is 5366170252753. The reversal of 5366170252721 is 1272520716635.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5366170252721 is a prime.
It is a super-2 number, since 2×53661702527212 (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 (5366170252711) 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, 2698610 + ... + 4244388.
It is an arithmetic number, because the mean of its divisors is an integer number (671540934300).
Almost surely, 25366170252721 is an apocalyptic number.
It is an amenable number.
5366170252721 is a deficient number, since it is larger than the sum of its proper divisors (6157221679).
5366170252721 is a wasteful number, since it uses less digits than its factorization.
5366170252721 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1549759.
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 5366170252721 in words is "five trillion, three hundred sixty-six billion, one hundred seventy million, two hundred fifty-two thousand, seven hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •