Base | Representation |
---|---|
bin | 110000111001000… |
… | …1101010000100100 |
3 | 11020022222122112012 |
4 | 1201302031100210 |
5 | 11324440121320 |
6 | 430442413352 |
7 | 55440312602 |
oct | 14162152044 |
9 | 4208878465 |
10 | 1640551460 |
11 | 772059659 |
12 | 399501258 |
13 | 201b63612 |
14 | 117c4c872 |
15 | 9905e4c5 |
hex | 61c8d424 |
1640551460 has 48 divisors (see below), whose sum is σ = 3571162560. Its totient is φ = 632311680.
The previous prime is 1640551441. The next prime is 1640551483. The reversal of 1640551460 is 641550461.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 314675 + ... + 319845.
It is an arithmetic number, because the mean of its divisors is an integer number (74399220).
Almost surely, 21640551460 is an apocalyptic number.
1640551460 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 1640551460, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1785581280).
1640551460 is an abundant number, since it is smaller than the sum of its proper divisors (1930611100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1640551460 is a wasteful number, since it uses less digits than its factorization.
1640551460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5756 (or 5754 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 1640551460 is about 40503.7215574075. The cubic root of 1640551460 is about 1179.4058725065.
Subtracting from 1640551460 its reverse (641550461), we obtain a palindrome (999000999).
The spelling of 1640551460 in words is "one billion, six hundred forty million, five hundred fifty-one thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •