Base | Representation |
---|---|
bin | 1110010001110111… |
… | …01011000000010000 |
3 | 201210021000211220221 |
4 | 13020323223000100 |
5 | 111200002200021 |
6 | 3304410042424 |
7 | 360654243100 |
oct | 71073530020 |
9 | 21707024827 |
10 | 7666053136 |
11 | 3284318205 |
12 | 159b419414 |
13 | 9522baa21 |
14 | 52a1b9200 |
15 | 2ed033241 |
hex | 1c8eeb010 |
7666053136 has 135 divisors (see below), whose sum is σ = 17913639261. Its totient is φ = 3168826752.
The previous prime is 7666053107. The next prime is 7666053137. The reversal of 7666053136 is 6313506667.
The square root of 7666053136 is 87556.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 5526435600 + 2139617536 = 74340^2 + 46256^2 .
It is a junction number, because it is equal to n+sod(n) for n = 7666053092 and 7666053101.
It is not an unprimeable number, because it can be changed into a prime (7666053137) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 129933075 + ... + 129933133.
Almost surely, 27666053136 is an apocalyptic number.
7666053136 is the 87556-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 7666053136
7666053136 is an abundant number, since it is smaller than the sum of its proper divisors (10247586125).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7666053136 is an equidigital number, since it uses as much as digits as its factorization.
7666053136 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 246 (or 121 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 43.
The cubic root of 7666053136 is about 1971.7746328532.
The spelling of 7666053136 in words is "seven billion, six hundred sixty-six million, fifty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •