Base | Representation |
---|---|
bin | 101010111111101… |
… | …0100011011000000 |
3 | 10201112121211022220 |
4 | 1111333110123000 |
5 | 10423310141310 |
6 | 355053131040 |
7 | 50515265616 |
oct | 12577243300 |
9 | 3645554286 |
10 | 1442662080 |
11 | 680388412 |
12 | 343189a80 |
13 | 19cb67c02 |
14 | d98596b6 |
15 | 869c0670 |
hex | 55fd46c0 |
1442662080 has 112 divisors (see below), whose sum is σ = 4692298464. Its totient is φ = 375316480.
The previous prime is 1442662063. The next prime is 1442662087. The reversal of 1442662080 is 802662441.
It is not an unprimeable number, because it can be changed into a prime (1442662087) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21034 + ... + 57686.
It is an arithmetic number, because the mean of its divisors is an integer number (41895522).
Almost surely, 21442662080 is an apocalyptic number.
1442662080 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 1442662080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2346149232).
1442662080 is an abundant number, since it is smaller than the sum of its proper divisors (3249636384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1442662080 is a wasteful number, since it uses less digits than its factorization.
1442662080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36714 (or 36704 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 33.
The square root of 1442662080 is about 37982.3917098437. The cubic root of 1442662080 is about 1129.9386710652.
The spelling of 1442662080 in words is "one billion, four hundred forty-two million, six hundred sixty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •