Base | Representation |
---|---|
bin | 101010010111000… |
… | …0110000100000000 |
3 | 10200001120001112112 |
4 | 1110232012010000 |
5 | 10402332311400 |
6 | 353012514452 |
7 | 50136304460 |
oct | 12456060400 |
9 | 3601501475 |
10 | 1421369600 |
11 | 66a365022 |
12 | 33801ba28 |
13 | 198621401 |
14 | d6ab5ba0 |
15 | 84bb6835 |
hex | 54b86100 |
1421369600 has 108 divisors (see below), whose sum is σ = 4020825984. Its totient is φ = 487311360.
The previous prime is 1421369569. The next prime is 1421369603. The reversal of 1421369600 is 69631241.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1421369603) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28937 + ... + 60663.
Almost surely, 21421369600 is an apocalyptic number.
1421369600 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 1421369600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2010412992).
1421369600 is an abundant number, since it is smaller than the sum of its proper divisors (2599456384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1421369600 is an equidigital number, since it uses as much as digits as its factorization.
1421369600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31760 (or 31741 counting only the distinct ones).
The product of its (nonzero) digits is 7776, while the sum is 32.
The square root of 1421369600 is about 37701.0556881369. The cubic root of 1421369600 is about 1124.3521141980.
The spelling of 1421369600 in words is "one billion, four hundred twenty-one million, three hundred sixty-nine thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •