Base | Representation |
---|---|
bin | 10100100011001110010… |
… | …110100110001100100000 |
3 | 12000000011102201021022202 |
4 | 110203032112212030200 |
5 | 141114202043200300 |
6 | 3000432205152332 |
7 | 204012625006055 |
oct | 24431626461440 |
9 | 5000142637282 |
10 | 1412211303200 |
11 | 4a4a08512105 |
12 | 1a984285b6a8 |
13 | a322b782779 |
14 | 4c4cc30d02c |
15 | 26b0521dad5 |
hex | 148ce5a6320 |
1412211303200 has 72 divisors (see below), whose sum is σ = 3505994195760. Its totient is φ = 555310188800.
The previous prime is 1412211303197. The next prime is 1412211303361. The reversal of 1412211303200 is 23031122141.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14912666 + ... + 15007065.
It is an arithmetic number, because the mean of its divisors is an integer number (48694363830).
Almost surely, 21412211303200 is an apocalyptic number.
1412211303200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1412211303200 is an abundant number, since it is smaller than the sum of its proper divisors (2093782892560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1412211303200 is a wasteful number, since it uses less digits than its factorization.
1412211303200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29919810 (or 29919797 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1412211303200 its reverse (23031122141), we get a palindrome (1435242425341).
The spelling of 1412211303200 in words is "one trillion, four hundred twelve billion, two hundred eleven million, three hundred three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •