Base | Representation |
---|---|
bin | 101010000111000… |
… | …0111011100111000 |
3 | 10122110210011100000 |
4 | 1110032013130320 |
5 | 10343211033210 |
6 | 352113113000 |
7 | 50005121460 |
oct | 12416073470 |
9 | 3573704300 |
10 | 1412986680 |
11 | 665659896 |
12 | 335258760 |
13 | 1969778c1 |
14 | d5932ba0 |
15 | 840acac0 |
hex | 54387738 |
1412986680 has 384 divisors, whose sum is σ = 5734310400. Its totient is φ = 305690112.
The previous prime is 1412986639. The next prime is 1412986711. The reversal of 1412986680 is 866892141.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1292214 + ... + 1293306.
It is an arithmetic number, because the mean of its divisors is an integer number (14933100).
Almost surely, 21412986680 is an apocalyptic number.
1412986680 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 1412986680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2867155200).
1412986680 is an abundant number, since it is smaller than the sum of its proper divisors (4321323720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1412986680 is a wasteful number, since it uses less digits than its factorization.
1412986680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1145 (or 1129 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 45.
The square root of 1412986680 is about 37589.7150827191. The cubic root of 1412986680 is about 1122.1373620039.
The spelling of 1412986680 in words is "one billion, four hundred twelve million, nine hundred eighty-six thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •