Base | Representation |
---|---|
bin | 1110001101111111… |
… | …1111111111100000 |
3 | 100212000000101002002 |
4 | 3203133333333200 |
5 | 30304101112413 |
6 | 1430423343132 |
7 | 163404256133 |
oct | 34337777740 |
9 | 10760011062 |
10 | 3816816608 |
11 | 16895478a0 |
12 | 8a62b1aa8 |
13 | 48a9a4887 |
14 | 282cac21a |
15 | 17513d958 |
hex | e37fffe0 |
3816816608 has 192 divisors, whose sum is σ = 9107997696. Its totient is φ = 1554432000.
The previous prime is 3816816589. The next prime is 3816816623. The reversal of 3816816608 is 8066186183.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11531003 + ... + 11531333.
It is an arithmetic number, because the mean of its divisors is an integer number (47437488).
Almost surely, 23816816608 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 3816816608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4553998848).
3816816608 is an abundant number, since it is smaller than the sum of its proper divisors (5291181088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3816816608 is a wasteful number, since it uses less digits than its factorization.
3816816608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457 (or 449 counting only the distinct ones).
The product of its (nonzero) digits is 331776, while the sum is 47.
The square root of 3816816608 is about 61780.3901573954. The cubic root of 3816816608 is about 1562.7893073084.
The spelling of 3816816608 in words is "three billion, eight hundred sixteen million, eight hundred sixteen thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •