Base | Representation |
---|---|
bin | 1101101101010100… |
… | …1011110110111100 |
3 | 100111110010101002212 |
4 | 3123111023312330 |
5 | 30014004421100 |
6 | 1405050035552 |
7 | 160121322431 |
oct | 33325136674 |
9 | 10443111085 |
10 | 3679763900 |
11 | 161914909a |
12 | 868418bb8 |
13 | 468489bb7 |
14 | 26c9d3b88 |
15 | 1680ba635 |
hex | db54bdbc |
3679763900 has 72 divisors (see below), whose sum is σ = 8476020000. Its totient is φ = 1381847040.
The previous prime is 3679763887. The next prime is 3679763909. The reversal of 3679763900 is 93679763.
It is a Harshad number since it is a multiple of its sum of digits (50).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3679763909) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 733601 + ... + 738599.
It is an arithmetic number, because the mean of its divisors is an integer number (117722500).
Almost surely, 23679763900 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 3679763900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4238010000).
3679763900 is an abundant number, since it is smaller than the sum of its proper divisors (4796256100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3679763900 is a wasteful number, since it uses less digits than its factorization.
3679763900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5463 (or 5456 counting only the distinct ones).
The product of its (nonzero) digits is 1285956, while the sum is 50.
The square root of 3679763900 is about 60661.0575245767. The cubic root of 3679763900 is about 1543.8555077676.
The spelling of 3679763900 in words is "three billion, six hundred seventy-nine million, seven hundred sixty-three thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •