Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …111011001101000110100 |
3 | 10220011022001012202100020 |
4 | 100000131033121220310 |
5 | 121010301031013322 |
6 | 2201200052445140 |
7 | 142321036314552 |
oct | 20003517315064 |
9 | 3804261182306 |
10 | 1100002204212 |
11 | 39456562705a |
12 | 1592306197b0 |
13 | 7c96439a642 |
14 | 3b3518bcbd2 |
15 | 1d930c8905c |
hex | 1001d3d9a34 |
1100002204212 has 48 divisors (see below), whose sum is σ = 2585152577280. Its totient is φ = 364033277568.
The previous prime is 1100002204177. The next prime is 1100002204241. The reversal of 1100002204212 is 2124022000011.
It is a junction number, because it is equal to n+sod(n) for n = 1100002204191 and 1100002204200.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 1098213 + ... + 1845555.
It is an arithmetic number, because the mean of its divisors is an integer number (53857345360).
Almost surely, 21100002204212 is an apocalyptic number.
1100002204212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1100002204212 is an abundant number, since it is smaller than the sum of its proper divisors (1485150373068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100002204212 is a wasteful number, since it uses less digits than its factorization.
1100002204212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 748232 (or 748230 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 1100002204212 its reverse (2124022000011), we get a palindrome (3224024204223).
The spelling of 1100002204212 in words is "one trillion, one hundred billion, two million, two hundred four thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •