Base | Representation |
---|---|
bin | 10000000101111111… |
… | …10110001101100100 |
3 | 211022011002222001212 |
4 | 20002333312031210 |
5 | 120143344214043 |
6 | 3545210010552 |
7 | 424053465461 |
oct | 100277661544 |
9 | 24264088055 |
10 | 8640226148 |
11 | 3734200874 |
12 | 1811716a58 |
13 | a79084468 |
14 | 5bd722668 |
15 | 358812018 |
hex | 202ff6364 |
8640226148 has 12 divisors (see below), whose sum is σ = 15133078380. Its totient is φ = 4316489472.
The previous prime is 8640226109. The next prime is 8640226169. The reversal of 8640226148 is 8416220468.
8640226148 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 5623800064 + 3016426084 = 74992^2 + 54922^2 .
It is a hoax number, since the sum of its digits (41) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 900533 + ... + 910076.
It is an arithmetic number, because the mean of its divisors is an integer number (1261089865).
Almost surely, 28640226148 is an apocalyptic number.
It is an amenable number.
8640226148 is a deficient number, since it is larger than the sum of its proper divisors (6492852232).
8640226148 is a wasteful number, since it uses less digits than its factorization.
8640226148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1811806 (or 1811804 counting only the distinct ones).
The product of its (nonzero) digits is 147456, while the sum is 41.
The square root of 8640226148 is about 92952.8167835704. The cubic root of 8640226148 is about 2051.9890389873.
The spelling of 8640226148 in words is "eight billion, six hundred forty million, two hundred twenty-six thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •