Base | Representation |
---|---|
bin | 10000001001100010… |
… | …11011001000110100 |
3 | 211101020010121122211 |
4 | 20010301123020310 |
5 | 120224004442133 |
6 | 3552152103204 |
7 | 424564531651 |
oct | 100461331064 |
9 | 24336117584 |
10 | 8669999668 |
11 | 3749a97090 |
12 | 181b694b04 |
13 | a822aa325 |
14 | 5c3672c28 |
15 | 35b243bcd |
hex | 204c5b234 |
8669999668 has 24 divisors (see below), whose sum is σ = 17422967520. Its totient is φ = 3733492320.
The previous prime is 8669999659. The next prime is 8669999669.
8669999668 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×86699996682 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (76).
It is a junction number, because it is equal to n+sod(n) for n = 8669999594 and 8669999603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8669999669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5184571 + ... + 5186242.
It is an arithmetic number, because the mean of its divisors is an integer number (725956980).
Almost surely, 28669999668 is an apocalyptic number.
It is an amenable number.
8669999668 is an abundant number, since it is smaller than the sum of its proper divisors (8752967852).
8669999668 is a wasteful number, since it uses less digits than its factorization.
8669999668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10370847 (or 10370845 counting only the distinct ones).
The product of its digits is 544195584, while the sum is 76.
The square root of 8669999668 is about 93112.8329930950. The cubic root of 8669999668 is about 2054.3433328687.
The spelling of 8669999668 in words is "eight billion, six hundred sixty-nine million, nine hundred ninety-nine thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •