Base | Representation |
---|---|
bin | 1010100010101111… |
… | …01010001110011101 |
3 | 112121110112002112111 |
4 | 11101113222032131 |
5 | 43042442432221 |
6 | 2333352034021 |
7 | 260156155264 |
oct | 52127521635 |
9 | 15543462474 |
10 | 5660124061 |
11 | 2444aa0a89 |
12 | 111b692911 |
13 | 6c2848a47 |
14 | 3b9a195db |
15 | 231d9dbe1 |
hex | 1515ea39d |
5660124061 has 4 divisors (see below), whose sum is σ = 5660278624. Its totient is φ = 5659969500.
The previous prime is 5660124049. The next prime is 5660124089. The reversal of 5660124061 is 1604210665.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 5660124061 - 231 = 3512640413 is a prime.
It is a super-2 number, since 2×56601240612 = 64074008771822263442, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5660124031) 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, 12136 + ... + 107086.
It is an arithmetic number, because the mean of its divisors is an integer number (1415069656).
Almost surely, 25660124061 is an apocalyptic number.
It is an amenable number.
5660124061 is a deficient number, since it is larger than the sum of its proper divisors (154563).
5660124061 is an equidigital number, since it uses as much as digits as its factorization.
5660124061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154562.
The product of its (nonzero) digits is 8640, while the sum is 31.
The square root of 5660124061 is about 75233.7960028603. The cubic root of 5660124061 is about 1782.1406788504.
The spelling of 5660124061 in words is "five billion, six hundred sixty million, one hundred twenty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •