Base | Representation |
---|---|
bin | 10000001011110101100… |
… | …111000100001110011100 |
3 | 10221022211200022221021110 |
4 | 100023311213010032130 |
5 | 121210312342034322 |
6 | 2210540422102020 |
7 | 143232621615354 |
oct | 20136547041634 |
9 | 3838750287243 |
10 | 1112222221212 |
11 | 3997664a2763 |
12 | 15b680b7a910 |
13 | 80b60ca752b |
14 | 3bb9080db64 |
15 | 1dde89b9c0c |
hex | 102f59c439c |
1112222221212 has 96 divisors (see below), whose sum is σ = 2636341747200. Its totient is φ = 364914063360.
The previous prime is 1112222221207. The next prime is 1112222221259. The reversal of 1112222221212 is 2121222222111.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
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 31 ways as a sum of consecutive naturals, for example, 151918512 + ... + 151925832.
It is an arithmetic number, because the mean of its divisors is an integer number (27461893200).
Almost surely, 21112222221212 is an apocalyptic number.
1112222221212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112222221212 is an abundant number, since it is smaller than the sum of its proper divisors (1524119525988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112222221212 is a wasteful number, since it uses less digits than its factorization.
1112222221212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8203 (or 8201 counting only the distinct ones).
The product of its digits is 256, while the sum is 21.
Adding to 1112222221212 its reverse (2121222222111), we get a palindrome (3233444443323).
The spelling of 1112222221212 in words is "one trillion, one hundred twelve billion, two hundred twenty-two million, two hundred twenty-one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •