Base | Representation |
---|---|
bin | 101001001110110001000… |
… | …0001111110110100110001 |
3 | 202001201202112010000210210 |
4 | 1102131202001332310301 |
5 | 1220320403334100230 |
6 | 20015125443414333 |
7 | 1123256161635021 |
oct | 122354201766461 |
9 | 22051675100723 |
10 | 5666706550065 |
11 | 1895267131480 |
12 | 7762b46843a9 |
13 | 3214a2a3b272 |
14 | 1583ad08da81 |
15 | 9c60d992eb0 |
hex | 5276207ed31 |
5666706550065 has 64 divisors (see below), whose sum is σ = 10321769336832. Its totient is φ = 2627847340800.
The previous prime is 5666706550027. The next prime is 5666706550069. The reversal of 5666706550065 is 5600556076665.
It is a happy number.
It is not a de Polignac number, because 5666706550065 - 216 = 5666706484529 is a prime.
It is a super-2 number, since 2×56667065500652 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5666706549987 and 5666706550014.
It is not an unprimeable number, because it can be changed into a prime (5666706550069) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 61550647 + ... + 61642643.
It is an arithmetic number, because the mean of its divisors is an integer number (161277645888).
Almost surely, 25666706550065 is an apocalyptic number.
5666706550065 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5666706550065 is a deficient number, since it is larger than the sum of its proper divisors (4655062786767).
5666706550065 is a wasteful number, since it uses less digits than its factorization.
5666706550065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108270.
The product of its (nonzero) digits is 34020000, while the sum is 57.
The spelling of 5666706550065 in words is "five trillion, six hundred sixty-six billion, seven hundred six million, five hundred fifty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •