Base | Representation |
---|---|
bin | 10000001011101111100… |
… | …100111100010100000101 |
3 | 10221022120121212102112220 |
4 | 100023233210330110011 |
5 | 121210110434014341 |
6 | 2210522404402553 |
7 | 143230252352346 |
oct | 20135744742405 |
9 | 3838517772486 |
10 | 1112121001221 |
11 | 39971434867a |
12 | 15b6530a6459 |
13 | 80b46027649 |
14 | 3bb811c20cd |
15 | 1dddeb73a66 |
hex | 102ef93c505 |
1112121001221 has 16 divisors (see below), whose sum is σ = 1485488970240. Its totient is φ = 740083947120.
The previous prime is 1112121001163. The next prime is 1112121001237. The reversal of 1112121001221 is 1221001212111.
It is a happy number.
It is not a de Polignac number, because 1112121001221 - 234 = 1094941132037 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1112121001221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112121501221) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 10948456 + ... + 11049566.
It is an arithmetic number, because the mean of its divisors is an integer number (92843060640).
Almost surely, 21112121001221 is an apocalyptic number.
It is an amenable number.
1112121001221 is a deficient number, since it is larger than the sum of its proper divisors (373367969019).
1112121001221 is a wasteful number, since it uses less digits than its factorization.
1112121001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107656.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1112121001221 its reverse (1221001212111), we get a palindrome (2333122213332).
The spelling of 1112121001221 in words is "one trillion, one hundred twelve billion, one hundred twenty-one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •