Base | Representation |
---|---|
bin | 110010000111011… |
… | …0101101011101100 |
3 | 11100012020201022102 |
4 | 1210032311223230 |
5 | 11420443032000 |
6 | 434510434232 |
7 | 56446314302 |
oct | 14416655354 |
9 | 4305221272 |
10 | 1681611500 |
11 | 793253678 |
12 | 3ab202978 |
13 | 20a50b7ba |
14 | 11d49a272 |
15 | 9c9703d5 |
hex | 643b5aec |
1681611500 has 48 divisors (see below), whose sum is σ = 3697127616. Its totient is φ = 668160000.
The previous prime is 1681611469. The next prime is 1681611517. The reversal of 1681611500 is 51161861.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 64364 + ... + 86636.
It is an arithmetic number, because the mean of its divisors is an integer number (77023492).
Almost surely, 21681611500 is an apocalyptic number.
1681611500 is a gapful number since it is divisible by the number (10) 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 1681611500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1848563808).
1681611500 is an abundant number, since it is smaller than the sum of its proper divisors (2015516116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1681611500 is a wasteful number, since it uses less digits than its factorization.
1681611500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22443 (or 22431 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 29.
The square root of 1681611500 is about 41007.4566390065. The cubic root of 1681611500 is about 1189.1643734561.
The spelling of 1681611500 in words is "one billion, six hundred eighty-one million, six hundred eleven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •