Base | Representation |
---|---|
bin | 101001001110101110000… |
… | …0100010100110100010110 |
3 | 202001201111112212000111010 |
4 | 1102131130010110310112 |
5 | 1220320202231014032 |
6 | 20015111511153050 |
7 | 1123253535350136 |
oct | 122353404246426 |
9 | 22051445760433 |
10 | 5666606501142 |
11 | 1895215707214 |
12 | 776287075786 |
13 | 3214880ab412 |
14 | 15839da88ac6 |
15 | 9c604ccdccc |
hex | 5275c114d16 |
5666606501142 has 16 divisors (see below), whose sum is σ = 11609632832112. Its totient is φ = 1842798862080.
The previous prime is 5666606501081. The next prime is 5666606501147. The reversal of 5666606501142 is 2411056066665.
It is a super-2 number, since 2×56666065011422 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5666606501091 and 5666606501100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5666606501147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11517492643 + ... + 11517493134.
It is an arithmetic number, because the mean of its divisors is an integer number (725602052007).
Almost surely, 25666606501142 is an apocalyptic number.
5666606501142 is an abundant number, since it is smaller than the sum of its proper divisors (5943026330970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5666606501142 is a wasteful number, since it uses less digits than its factorization.
5666606501142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23034985823.
The product of its (nonzero) digits is 1555200, while the sum is 48.
The spelling of 5666606501142 in words is "five trillion, six hundred sixty-six billion, six hundred six million, five hundred one thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •