Base | Representation |
---|---|
bin | 101001000111101101010… |
… | …1110010010010111001001 |
3 | 202000021122100022211022110 |
4 | 1102033122232102113021 |
5 | 1220043334144424121 |
6 | 20004141551412533 |
7 | 1122211500436632 |
oct | 122173256222711 |
9 | 22007570284273 |
10 | 5651551561161 |
11 | 188989a57aa60 |
12 | 773385224149 |
13 | 31cc290675cc |
14 | 157772442889 |
15 | 9c023265d76 |
hex | 523dab925c9 |
5651551561161 has 8 divisors (see below), whose sum is σ = 8220438634464. Its totient is φ = 3425182764320.
The previous prime is 5651551561153. The next prime is 5651551561181. The reversal of 5651551561161 is 1611651551565.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5651551561161 - 23 = 5651551561153 is a prime.
It is a super-2 number, since 2×56515515611612 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5651551561161.
It is not an unprimeable number, because it can be changed into a prime (5651551561181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85629569076 + ... + 85629569141.
It is an arithmetic number, because the mean of its divisors is an integer number (1027554829308).
Almost surely, 25651551561161 is an apocalyptic number.
It is an amenable number.
5651551561161 is a deficient number, since it is larger than the sum of its proper divisors (2568887073303).
5651551561161 is a wasteful number, since it uses less digits than its factorization.
5651551561161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 171259138231.
The product of its digits is 675000, while the sum is 48.
The spelling of 5651551561161 in words is "five trillion, six hundred fifty-one billion, five hundred fifty-one million, five hundred sixty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •