Base | Representation |
---|---|
bin | 1110111010010110… |
… | …01100111110001100 |
3 | 202122221002002221221 |
4 | 13131023030332030 |
5 | 112343422344443 |
6 | 3402221133124 |
7 | 402250030060 |
oct | 73513147614 |
9 | 22587062857 |
10 | 8005668748 |
11 | 3438a9a470 |
12 | 16750ba1a4 |
13 | 9a77793cc |
14 | 55d341aa0 |
15 | 31cc69eed |
hex | 1dd2ccf8c |
8005668748 has 48 divisors (see below), whose sum is σ = 17491428864. Its totient is φ = 3114714240.
The previous prime is 8005668743. The next prime is 8005668761. The reversal of 8005668748 is 8478665008.
It is a Smith number, since the sum of its digits (52) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 8005668695 and 8005668704.
It is not an unprimeable number, because it can be changed into a prime (8005668743) 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 15 ways as a sum of consecutive naturals, for example, 206040 + ... + 241792.
It is an arithmetic number, because the mean of its divisors is an integer number (364404768).
Almost surely, 28005668748 is an apocalyptic number.
It is an amenable number.
8005668748 is an abundant number, since it is smaller than the sum of its proper divisors (9485760116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8005668748 is a wasteful number, since it uses less digits than its factorization.
8005668748 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36502 (or 36500 counting only the distinct ones).
The product of its (nonzero) digits is 2580480, while the sum is 52.
The square root of 8005668748 is about 89474.4027529662. The cubic root of 8005668748 is about 2000.4722841317.
The spelling of 8005668748 in words is "eight billion, five million, six hundred sixty-eight thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •