Base | Representation |
---|---|
bin | 101001111001000… |
… | …1000000000000000 |
3 | 10121221222100210020 |
4 | 1103302020000000 |
5 | 10334321231041 |
6 | 351251533440 |
7 | 46555550511 |
oct | 12362100000 |
9 | 3557870706 |
10 | 1405648896 |
11 | 6614a7903 |
12 | 3328ba280 |
13 | 1952a8a12 |
14 | d4982a08 |
15 | 8360d866 |
hex | 53c88000 |
1405648896 has 128 divisors (see below), whose sum is σ = 3816758400. Its totient is φ = 460062720.
The previous prime is 1405648877. The next prime is 1405648913. The reversal of 1405648896 is 6988465041.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7765926 + ... + 7766106.
It is an arithmetic number, because the mean of its divisors is an integer number (29818425).
Almost surely, 21405648896 is an apocalyptic number.
1405648896 is a gapful number since it is divisible by the number (16) 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 1405648896, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1908379200).
1405648896 is an abundant number, since it is smaller than the sum of its proper divisors (2411109504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1405648896 is an frugal number, since it uses more digits than its factorization.
1405648896 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 293 (or 265 counting only the distinct ones).
The product of its (nonzero) digits is 1658880, while the sum is 51.
The square root of 1405648896 is about 37491.9844233404. The cubic root of 1405648896 is about 1120.1915318700.
The spelling of 1405648896 in words is "one billion, four hundred five million, six hundred forty-eight thousand, eight hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •