Base | Representation |
---|---|
bin | 101010111011000… |
… | …0101000111100100 |
3 | 10201101001202222221 |
4 | 1111312011013210 |
5 | 10422200140400 |
6 | 354525202124 |
7 | 50455560505 |
oct | 12566050744 |
9 | 3641052887 |
10 | 1440240100 |
11 | 679a83782 |
12 | 342400344 |
13 | 19c4ca6a0 |
14 | d93c8bac |
15 | 86692c1a |
hex | 55d851e4 |
1440240100 has 72 divisors (see below), whose sum is σ = 3380431208. Its totient is φ = 529459200.
The previous prime is 1440240089. The next prime is 1440240121. The reversal of 1440240100 is 10420441.
It can be written as a sum of positive squares in 12 ways, for example, as 819333376 + 620906724 = 28624^2 + 24918^2 .
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 311002 + ... + 315598.
Almost surely, 21440240100 is an apocalyptic number.
1440240100 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 1440240100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1690215604).
1440240100 is an abundant number, since it is smaller than the sum of its proper divisors (1940191108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1440240100 is a wasteful number, since it uses less digits than its factorization.
1440240100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4865 (or 4858 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
The square root of 1440240100 is about 37950.4953854360. The cubic root of 1440240100 is about 1129.3059930445.
Adding to 1440240100 its reverse (10420441), we get a palindrome (1450660541).
The spelling of 1440240100 in words is "one billion, four hundred forty million, two hundred forty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •