Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …100100000100010110100 |
3 | 10220011112212020220200202 |
4 | 100000203010200202310 |
5 | 121011001100342322 |
6 | 2201213505100032 |
7 | 142323334550225 |
oct | 20004304404264 |
9 | 3804485226622 |
10 | 1100100012212 |
11 | 394605860713 |
12 | 159259327618 |
13 | 7c97b7244b6 |
14 | 3b36089d24c |
15 | 1d939659292 |
hex | 100231208b4 |
1100100012212 has 24 divisors (see below), whose sum is σ = 1961571277512. Its totient is φ = 539651840000.
The previous prime is 1100100012211. The next prime is 1100100012247. The reversal of 1100100012212 is 2122100010011.
It can be written as a sum of positive squares in 4 ways, for example, as 26275876 + 1100073736336 = 5126^2 + 1048844^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1100100012193 and 1100100012202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100100012211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6874712 + ... + 7032912.
It is an arithmetic number, because the mean of its divisors is an integer number (81732136563).
Almost surely, 21100100012212 is an apocalyptic number.
It is an amenable number.
1100100012212 is a deficient number, since it is larger than the sum of its proper divisors (861471265300).
1100100012212 is a wasteful number, since it uses less digits than its factorization.
1100100012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 191059 (or 191057 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1100100012212 its reverse (2122100010011), we get a palindrome (3222200022223).
The spelling of 1100100012212 in words is "one trillion, one hundred billion, one hundred million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •