Base | Representation |
---|---|
bin | 101001001011111011010… |
… | …1100000001111001000011 |
3 | 202001011000200122000222210 |
4 | 1102113312230001321003 |
5 | 1220220412312303201 |
6 | 20012240523433203 |
7 | 1122652131526305 |
oct | 122276654017103 |
9 | 22034020560883 |
10 | 5660610666051 |
11 | 1892719170600 |
12 | 775093085803 |
13 | 320a40b402c3 |
14 | 157d91641975 |
15 | 9c3a371a1d6 |
hex | 525f6b01e43 |
5660610666051 has 48 divisors (see below), whose sum is σ = 8786048679072. Its totient is φ = 3228112419840.
The previous prime is 5660610666049. The next prime is 5660610666091. The reversal of 5660610666051 is 1506660160665.
It is not a de Polignac number, because 5660610666051 - 21 = 5660610666049 is a prime.
It is a super-2 number, since 2×56606106660512 (a number of 26 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (5660610666041) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 26781781 + ... + 26992313.
It is an arithmetic number, because the mean of its divisors is an integer number (183042680814).
Almost surely, 25660610666051 is an apocalyptic number.
5660610666051 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
5660610666051 is a deficient number, since it is larger than the sum of its proper divisors (3125438013021).
5660610666051 is a wasteful number, since it uses less digits than its factorization.
5660610666051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214932 (or 214921 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 5660610666051 in words is "five trillion, six hundred sixty billion, six hundred ten million, six hundred sixty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •