Base | Representation |
---|---|
bin | 101010000000000… |
… | …0000000000000000 |
3 | 10122012211011011010 |
4 | 1110000000000000 |
5 | 10341234124034 |
6 | 351501520520 |
7 | 46631506650 |
oct | 12400000000 |
9 | 3565734133 |
10 | 1409286144 |
11 | 6635615a2 |
12 | 333b73140 |
13 | 195c80436 |
14 | d524c360 |
15 | 83acb3e9 |
hex | 54000000 |
1409286144 has 108 divisors (see below), whose sum is σ = 4294967264. Its totient is φ = 402653184.
The previous prime is 1409286139. The next prime is 1409286161. The reversal of 1409286144 is 4416829041.
It is a nialpdrome in base 4 and base 16.
It is a zygodrome in base 4.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (3) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 201326589 + ... + 201326595.
Almost surely, 21409286144 is an apocalyptic number.
1409286144 is a gapful number since it is divisible by the number (14) 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 1409286144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2147483632).
1409286144 is an abundant number, since it is smaller than the sum of its proper divisors (2885681120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1409286144 is an frugal number, since it uses more digits than its factorization.
1409286144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62 (or 12 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 39.
The square root of 1409286144 is about 37540.4600930782. The cubic root of 1409286144 is about 1121.1568998113.
The spelling of 1409286144 in words is "one billion, four hundred nine million, two hundred eighty-six thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •