Base | Representation |
---|---|
bin | 101010001101101… |
… | …1111011010000000 |
3 | 10122201101021122120 |
4 | 1110123133122000 |
5 | 10400110231142 |
6 | 352320204240 |
7 | 50046663150 |
oct | 12433373200 |
9 | 3581337576 |
10 | 1416492672 |
11 | 667633a01 |
12 | 336469680 |
13 | 19760465a |
14 | d61a6760 |
15 | 845517ec |
hex | 546df680 |
1416492672 has 256 divisors, whose sum is σ = 4512153600. Its totient is φ = 385228800.
The previous prime is 1416492667. The next prime is 1416492739. The reversal of 1416492672 is 2762946141.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7416097 + ... + 7416287.
It is an arithmetic number, because the mean of its divisors is an integer number (17625600).
Almost surely, 21416492672 is an apocalyptic number.
1416492672 is a gapful number since it is divisible by the number (12) 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 1416492672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2256076800).
1416492672 is an abundant number, since it is smaller than the sum of its proper divisors (3095660928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1416492672 is a wasteful number, since it uses less digits than its factorization.
1416492672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335 (or 323 counting only the distinct ones).
The product of its digits is 145152, while the sum is 42.
The square root of 1416492672 is about 37636.3211804767. The cubic root of 1416492672 is about 1123.0647015217.
The spelling of 1416492672 in words is "one billion, four hundred sixteen million, four hundred ninety-two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •