Base | Representation |
---|---|
bin | 1110001001001000… |
… | …1101010000000000 |
3 | 100210120122022020110 |
4 | 3202102031100000 |
5 | 30233341024210 |
6 | 1424414311320 |
7 | 163036032420 |
oct | 34222152000 |
9 | 10716568213 |
10 | 3796423680 |
11 | 1678a89335 |
12 | 89b4b8540 |
13 | 4866b465a |
14 | 2802c0480 |
15 | 173461420 |
hex | e248d400 |
3796423680 has 704 divisors, whose sum is σ = 15393964032. Its totient is φ = 778567680.
The previous prime is 3796423667. The next prime is 3796423681. The reversal of 3796423680 is 863246973.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3796423681) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 56663007 + ... + 56663073.
Almost surely, 23796423680 is an apocalyptic number.
3796423680 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 3796423680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7696982016).
3796423680 is an abundant number, since it is smaller than the sum of its proper divisors (11597540352).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3796423680 is a wasteful number, since it uses less digits than its factorization.
3796423680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 150 (or 132 counting only the distinct ones).
The product of its (nonzero) digits is 1306368, while the sum is 48.
The square root of 3796423680 is about 61615.1254157613. The cubic root of 3796423680 is about 1560.0010519388.
The spelling of 3796423680 in words is "three billion, seven hundred ninety-six million, four hundred twenty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •