Base | Representation |
---|---|
bin | 1111001000010000… |
… | …10110000100000000 |
3 | 202222001122122100112 |
4 | 13210020112010000 |
5 | 113113311010224 |
6 | 3421550210452 |
7 | 405164631020 |
oct | 74410260400 |
9 | 22861578315 |
10 | 8122360064 |
11 | 3498951375 |
12 | 16a81b3a28 |
13 | 9c59b5320 |
14 | 570a39a80 |
15 | 32811a30e |
hex | 1e4216100 |
8122360064 has 144 divisors (see below), whose sum is σ = 20095299840. Its totient is φ = 3190579200.
The previous prime is 8122360061. The next prime is 8122360069. The reversal of 8122360064 is 4600632218.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a self number, because there is not a number n which added to its sum of digits gives 8122360064.
It is not an unprimeable number, because it can be changed into a prime (8122360061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3516542 + ... + 3518850.
Almost surely, 28122360064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 8122360064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10047649920).
8122360064 is an abundant number, since it is smaller than the sum of its proper divisors (11972939776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8122360064 is a wasteful number, since it uses less digits than its factorization.
8122360064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2496 (or 2482 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 32.
The square root of 8122360064 is about 90124.1369667416. The cubic root of 8122360064 is about 2010.1451232231.
The spelling of 8122360064 in words is "eight billion, one hundred twenty-two million, three hundred sixty thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •