Base | Representation |
---|---|
bin | 1110001010001001… |
… | …0000100110010000 |
3 | 100210212120002112220 |
4 | 3202202100212100 |
5 | 30240430203241 |
6 | 1425044421040 |
7 | 163116556611 |
oct | 34242204620 |
9 | 10725502486 |
10 | 3800631696 |
11 | 16803a2934 |
12 | 8a09a7780 |
13 | 487528ac4 |
14 | 280a97c08 |
15 | 1739e3166 |
hex | e2890990 |
3800631696 has 80 divisors (see below), whose sum is σ = 10046678400. Its totient is φ = 1237616640.
The previous prime is 3800631691. The next prime is 3800631719. The reversal of 3800631696 is 6961360083.
It is not an unprimeable number, because it can be changed into a prime (3800631691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 610005 + ... + 616203.
It is an arithmetic number, because the mean of its divisors is an integer number (125583480).
Almost surely, 23800631696 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 3800631696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5023339200).
3800631696 is an abundant number, since it is smaller than the sum of its proper divisors (6246046704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3800631696 is a wasteful number, since it uses less digits than its factorization.
3800631696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6504 (or 6498 counting only the distinct ones).
The product of its (nonzero) digits is 139968, while the sum is 42.
The square root of 3800631696 is about 61649.2635479127. The cubic root of 3800631696 is about 1560.5772157208.
The spelling of 3800631696 in words is "three billion, eight hundred million, six hundred thirty-one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •