Base | Representation |
---|---|
bin | 1101011111001101… |
… | …0010010101101000 |
3 | 100100022200210021110 |
4 | 3113303102111220 |
5 | 24403324432041 |
6 | 1355132510320 |
7 | 155502063252 |
oct | 32763222550 |
9 | 10308623243 |
10 | 3620545896 |
11 | 15987817a0 |
12 | 85061b3a0 |
13 | 459124b66 |
14 | 264bbacd2 |
15 | 162cbe516 |
hex | d7cd2568 |
3620545896 has 128 divisors (see below), whose sum is σ = 10515173760. Its totient is φ = 1026662400.
The previous prime is 3620545891. The next prime is 3620545937. The reversal of 3620545896 is 6985450263.
It is not an unprimeable number, because it can be changed into a prime (3620545891) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 810100 + ... + 814556.
It is an arithmetic number, because the mean of its divisors is an integer number (82149795).
Almost surely, 23620545896 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 3620545896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5257586880).
3620545896 is an abundant number, since it is smaller than the sum of its proper divisors (6894627864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3620545896 is a wasteful number, since it uses less digits than its factorization.
3620545896 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4675 (or 4671 counting only the distinct ones).
The product of its (nonzero) digits is 1555200, while the sum is 48.
The square root of 3620545896 is about 60170.9722042116. The cubic root of 3620545896 is about 1535.5289863024.
The spelling of 3620545896 in words is "three billion, six hundred twenty million, five hundred forty-five thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •