Base | Representation |
---|---|
bin | 1001100110100000011111… |
… | …01000000111001001010000 |
3 | 2202202111202100202210102112 |
4 | 10303100033220013021100 |
5 | 10231414112234303100 |
6 | 112523441345004452 |
7 | 4306313365445234 |
oct | 463201750071120 |
9 | 82674670683375 |
10 | 21114321400400 |
11 | 6800595a88128 |
12 | 245011b623728 |
13 | ba20c214c617 |
14 | 52dd1d7825c4 |
15 | 269372ca4b35 |
hex | 13340fa07250 |
21114321400400 has 120 divisors (see below), whose sum is σ = 51638972956704. Its totient is φ = 8294348275200.
The previous prime is 21114321400391. The next prime is 21114321400423. The reversal of 21114321400400 is 400412341112.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15016307 + ... + 16362093.
Almost surely, 221114321400400 is an apocalyptic number.
21114321400400 is a gapful number since it is divisible by the number (20) 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 21114321400400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25819486478352).
21114321400400 is an abundant number, since it is smaller than the sum of its proper divisors (30524651556304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21114321400400 is a wasteful number, since it uses less digits than its factorization.
21114321400400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1346509 (or 1346498 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 21114321400400 its reverse (400412341112), we get a palindrome (21514733741512).
The spelling of 21114321400400 in words is "twenty-one trillion, one hundred fourteen billion, three hundred twenty-one million, four hundred thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •