Base | Representation |
---|---|
bin | 10100100011010101011… |
… | …111100101100000101000 |
3 | 12000000110210010120220200 |
4 | 110203111133211200220 |
5 | 141114423230201300 |
6 | 3000452124552200 |
7 | 204015611163336 |
oct | 24432537454050 |
9 | 5000423116820 |
10 | 1412331100200 |
11 | 4a4a6a0a5399 |
12 | 1a98769b2660 |
13 | a324a538177 |
14 | 4c5001b4b56 |
15 | 26b109d4200 |
hex | 148d57e5828 |
1412331100200 has 144 divisors (see below), whose sum is σ = 4992714448800. Its totient is φ = 356799427200.
The previous prime is 1412331100189. The next prime is 1412331100211. The reversal of 1412331100200 is 20011332141.
It is an interprime number because it is at equal distance from previous prime (1412331100189) and next prime (1412331100211).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 20613916 + ... + 20682315.
Almost surely, 21412331100200 is an apocalyptic number.
1412331100200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1412331100200 is an abundant number, since it is smaller than the sum of its proper divisors (3580383348600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1412331100200 is a wasteful number, since it uses less digits than its factorization.
1412331100200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41296272 (or 41296260 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 1412331100200 its reverse (20011332141), we get a palindrome (1432342432341).
The spelling of 1412331100200 in words is "one trillion, four hundred twelve billion, three hundred thirty-one million, one hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •