Base | Representation |
---|---|
bin | 101001001011111001000… |
… | …1111110010000001000011 |
3 | 202001010211111102100002222 |
4 | 1102113302033302001003 |
5 | 1220220234223332011 |
6 | 20012225302401255 |
7 | 1122650235262460 |
oct | 122276217620103 |
9 | 22033744370088 |
10 | 5660536152131 |
11 | 18926900a7153 |
12 | 77507213022b |
13 | 320a2b581023 |
14 | 157d857a6667 |
15 | 9c39bdebddb |
hex | 525f23f2043 |
5660536152131 has 4 divisors (see below), whose sum is σ = 6469184173872. Its totient is φ = 4851888130392.
The previous prime is 5660536152119. The next prime is 5660536152143. The reversal of 5660536152131 is 1312516350665.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (5660536152119) and next prime (5660536152143).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5660536152131 is a prime.
It is a super-2 number, since 2×56605361521312 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5660536158131) 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, 404324010860 + ... + 404324010873.
It is an arithmetic number, because the mean of its divisors is an integer number (1617296043468).
Almost surely, 25660536152131 is an apocalyptic number.
5660536152131 is a deficient number, since it is larger than the sum of its proper divisors (808648021741).
5660536152131 is an equidigital number, since it uses as much as digits as its factorization.
5660536152131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 808648021740.
The product of its (nonzero) digits is 486000, while the sum is 44.
The spelling of 5660536152131 in words is "five trillion, six hundred sixty billion, five hundred thirty-six million, one hundred fifty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •