Base | Representation |
---|---|
bin | 10100100011001101101… |
… | …100010100010101100000 |
3 | 12000000010122212012000212 |
4 | 110203031230110111200 |
5 | 141114141224020000 |
6 | 3000431131433252 |
7 | 204012431545403 |
oct | 24431554242540 |
9 | 5000118765025 |
10 | 1412200220000 |
11 | 4a4a02232139 |
12 | 1a983abb5828 |
13 | a32293a1b6b |
14 | 4c4caa65d3a |
15 | 26b0427ec35 |
hex | 148cdb14560 |
1412200220000 has 60 divisors (see below), whose sum is σ = 3474224420436. Its totient is φ = 564880080000.
The previous prime is 1412200219987. The next prime is 1412200220003. The reversal of 1412200220000 is 220022141.
It is a super-2 number, since 2×14122002200002 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1412200220003) by changing a digit.
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 9 ways as a sum of consecutive naturals, for example, 35285006 + ... + 35325005.
Almost surely, 21412200220000 is an apocalyptic number.
1412200220000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1412200220000 is an abundant number, since it is smaller than the sum of its proper divisors (2062024200436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1412200220000 is an frugal number, since it uses more digits than its factorization.
1412200220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70610041 (or 70610018 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 1412200220000 its reverse (220022141), we get a palindrome (1412420242141).
The spelling of 1412200220000 in words is "one trillion, four hundred twelve billion, two hundred million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •