Base | Representation |
---|---|
bin | 1100010011000000… |
… | …10000000000000000 |
3 | 122001002122021022000 |
4 | 12021200100000000 |
5 | 102010041300112 |
6 | 3011033344000 |
7 | 322413136650 |
oct | 61140200000 |
9 | 18032567260 |
10 | 6601900032 |
11 | 2888667232 |
12 | 1342b68000 |
13 | 8129ab430 |
14 | 468b2c360 |
15 | 2898cd7dc |
hex | 189810000 |
6601900032 has 544 divisors, whose sum is σ = 24662319360. Its totient is φ = 1698693120.
The previous prime is 6601900021. The next prime is 6601900057. The reversal of 6601900032 is 2300091066.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 6601899969 and 6601900005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 161021932 + ... + 161021972.
Almost surely, 26601900032 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 6601900032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12331159680).
6601900032 is an abundant number, since it is smaller than the sum of its proper divisors (18060419328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6601900032 is an equidigital number, since it uses as much as digits as its factorization.
6601900032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102 (or 66 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 6601900032 is about 81252.0770934504. The cubic root of 6601900032 is about 1875.9574399748.
Adding to 6601900032 its reverse (2300091066), we get a palindrome (8901991098).
The spelling of 6601900032 in words is "six billion, six hundred one million, nine hundred thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •