Base | Representation |
---|---|
bin | 101010010111110… |
… | …0111010101000000 |
3 | 10200002022022001002 |
4 | 1110233213111000 |
5 | 10402433034000 |
6 | 353025231132 |
7 | 50142554132 |
oct | 12457472500 |
9 | 3602268032 |
10 | 1421768000 |
11 | 66a607384 |
12 | 3381924a8 |
13 | 198730853 |
14 | d6b7b052 |
15 | 84c448d5 |
hex | 54be7540 |
1421768000 has 112 divisors (see below), whose sum is σ = 3674571264. Its totient is φ = 543910400.
The previous prime is 1421767961. The next prime is 1421768003. The reversal of 1421768000 is 8671241.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421768003) 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, 180137 + ... + 187863.
It is an arithmetic number, because the mean of its divisors is an integer number (32808672).
Almost surely, 21421768000 is an apocalyptic number.
1421768000 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 1421768000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1837285632).
1421768000 is an abundant number, since it is smaller than the sum of its proper divisors (2252803264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1421768000 is an equidigital number, since it uses as much as digits as its factorization.
1421768000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7777 (or 7757 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 29.
The square root of 1421768000 is about 37706.3389896182. The cubic root of 1421768000 is about 1124.4571537404.
The spelling of 1421768000 in words is "one billion, four hundred twenty-one million, seven hundred sixty-eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •