Base | Representation |
---|---|
bin | 101001001110111101010… |
… | …1111100011101010001001 |
3 | 202001202211102020220211012 |
4 | 1102131322233203222021 |
5 | 1220322231003304401 |
6 | 20015234534013305 |
7 | 1123302354656651 |
oct | 122357257435211 |
9 | 22052742226735 |
10 | 5667121150601 |
11 | 189545a169a49 |
12 | 7763ab4a7235 |
13 | 32153a8c2421 |
14 | 15840c175361 |
15 | 9c63508c8bb |
hex | 5277abe3a89 |
5667121150601 has 4 divisors (see below), whose sum is σ = 5670643290900. Its totient is φ = 5663599010304.
The previous prime is 5667121150583. The next prime is 5667121150637. The reversal of 5667121150601 is 1060511217665.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2543064900601 + 3124056250000 = 1594699^2 + 1767500^2 .
It is a cyclic number.
It is not a de Polignac number, because 5667121150601 - 234 = 5649941281417 is a prime.
It is a super-2 number, since 2×56671211506012 (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 (5667121150001) 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, 1761067736 + ... + 1761070953.
It is an arithmetic number, because the mean of its divisors is an integer number (1417660822725).
Almost surely, 25667121150601 is an apocalyptic number.
It is an amenable number.
5667121150601 is a deficient number, since it is larger than the sum of its proper divisors (3522140299).
5667121150601 is a wasteful number, since it uses less digits than its factorization.
5667121150601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3522140298.
The product of its (nonzero) digits is 75600, while the sum is 41.
The spelling of 5667121150601 in words is "five trillion, six hundred sixty-seven billion, one hundred twenty-one million, one hundred fifty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •