Base | Representation |
---|---|
bin | 10000001100000000… |
… | …10001000111100000 |
3 | 211102200000200021121 |
4 | 20012000101013200 |
5 | 120244302334000 |
6 | 3554211102024 |
7 | 425235313330 |
oct | 100600210740 |
9 | 24380020247 |
10 | 8690668000 |
11 | 375a723553 |
12 | 18265a1914 |
13 | a86665a01 |
14 | 5c62d30c0 |
15 | 35ce77b1a |
hex | 2060111e0 |
8690668000 has 192 divisors, whose sum is σ = 24535719936. Its totient is φ = 2963520000.
The previous prime is 8690667989. The next prime is 8690668009. The reversal of 8690668000 is 8660968.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (8690668009) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5907265 + ... + 5908735.
It is an arithmetic number, because the mean of its divisors is an integer number (127790208).
Almost surely, 28690668000 is an apocalyptic number.
8690668000 is a gapful number since it is divisible by the number (80) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 8690668000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12267859968).
8690668000 is an abundant number, since it is smaller than the sum of its proper divisors (15845051936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8690668000 is a wasteful number, since it uses less digits than its factorization.
8690668000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1714 (or 1696 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 43.
The square root of 8690668000 is about 93223.7523381246. The cubic root of 8690668000 is about 2055.9744807503.
The spelling of 8690668000 in words is "eight billion, six hundred ninety million, six hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •