Base | Representation |
---|---|
bin | 101010000001001… |
… | …0111100000000000 |
3 | 10122020222200101020 |
4 | 1110002113200000 |
5 | 10341414003223 |
6 | 351523105440 |
7 | 46640003061 |
oct | 12402274000 |
9 | 3566880336 |
10 | 1409906688 |
11 | 663945843 |
12 | 334212280 |
13 | 196139a18 |
14 | d5370568 |
15 | 83ba01e3 |
hex | 54097800 |
1409906688 has 192 divisors, whose sum is σ = 4003927200. Its totient is φ = 440401920.
The previous prime is 1409906681. The next prime is 1409906699. The reversal of 1409906688 is 8866099041.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (192).
It is a self number, because there is not a number n which added to its sum of digits gives 1409906688.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1409906681) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7305120 + ... + 7305312.
Almost surely, 21409906688 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 1409906688, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2001963600).
1409906688 is an abundant number, since it is smaller than the sum of its proper divisors (2594020512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1409906688 is a wasteful number, since it uses less digits than its factorization.
1409906688 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288 (or 268 counting only the distinct ones).
The product of its (nonzero) digits is 746496, while the sum is 51.
The square root of 1409906688 is about 37548.7241860493. The cubic root of 1409906688 is about 1121.3214334891.
The spelling of 1409906688 in words is "one billion, four hundred nine million, nine hundred six thousand, six hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •