Base | Representation |
---|---|
bin | 10000001011101111100… |
… | …001001010010111100011 |
3 | 10221022120120000002010211 |
4 | 100023233201022113203 |
5 | 121210110210311321 |
6 | 2210522331234551 |
7 | 143230241054200 |
oct | 20135741122743 |
9 | 3838516002124 |
10 | 1112120010211 |
11 | 399713831061 |
12 | 15b6528a8a57 |
13 | 80b45a6b552 |
14 | 3bb81004ca7 |
15 | 1dddea2a0e1 |
hex | 102ef84a5e3 |
1112120010211 has 6 divisors (see below), whose sum is σ = 1293690624180. Its totient is φ = 953245722996.
The previous prime is 1112120010181. The next prime is 1112120010217. The reversal of 1112120010211 is 1120100212111.
It is a happy number.
It is not a de Polignac number, because 1112120010211 - 227 = 1111985792483 is a prime.
It is a super-2 number, since 2×11121200102112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112120010191 and 1112120010200.
It is not an unprimeable number, because it can be changed into a prime (1112120010217) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 11348163321 + ... + 11348163418.
It is an arithmetic number, because the mean of its divisors is an integer number (215615104030).
Almost surely, 21112120010211 is an apocalyptic number.
1112120010211 is a deficient number, since it is larger than the sum of its proper divisors (181570613969).
1112120010211 is an equidigital number, since it uses as much as digits as its factorization.
1112120010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22696326753 (or 22696326746 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1112120010211 its reverse (1120100212111), we get a palindrome (2232220222322).
The spelling of 1112120010211 in words is "one trillion, one hundred twelve billion, one hundred twenty million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •