Base | Representation |
---|---|
bin | 101001001110010111101… |
… | …1010001011001100111001 |
3 | 202001122120100000022220102 |
4 | 1102130233122023030321 |
5 | 1220312133424113301 |
6 | 20014505304205145 |
7 | 1123226140015544 |
oct | 122345732131471 |
9 | 22048510008812 |
10 | 5665857254201 |
11 | 1894970790971 |
12 | 7760b81697b5 |
13 | 321398ab8631 |
14 | 15832c37185b |
15 | 9c5ae12eb6b |
hex | 5272f68b339 |
5665857254201 has 12 divisors (see below), whose sum is σ = 5980695886692. Its totient is φ = 5366809812384.
The previous prime is 5665857254171. The next prime is 5665857254209. The reversal of 5665857254201 is 1024527585665.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 4693613925625 + 972243328576 = 2166475^2 + 986024^2 .
It is not a de Polignac number, because 5665857254201 - 218 = 5665856992057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5665857254209) 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 11 ways as a sum of consecutive naturals, for example, 1069295 + ... + 3532011.
It is an arithmetic number, because the mean of its divisors is an integer number (498391323891).
Almost surely, 25665857254201 is an apocalyptic number.
It is an amenable number.
5665857254201 is a deficient number, since it is larger than the sum of its proper divisors (314838632491).
5665857254201 is a wasteful number, since it uses less digits than its factorization.
5665857254201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2469128 (or 2469109 counting only the distinct ones).
The product of its (nonzero) digits is 20160000, while the sum is 56.
The spelling of 5665857254201 in words is "five trillion, six hundred sixty-five billion, eight hundred fifty-seven million, two hundred fifty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •