Base | Representation |
---|---|
bin | 10000000001011111010… |
… | …101111101111111000101 |
3 | 10220021011100000201001000 |
4 | 100001133111331333011 |
5 | 121020033433102323 |
6 | 2201502110523513 |
7 | 142360363650312 |
oct | 20013725757705 |
9 | 3807140021030 |
10 | 1101111222213 |
11 | 394a84640762 |
12 | 15949bb06599 |
13 | 7cab0087c02 |
14 | 3b418cc7d09 |
15 | 1d998301e43 |
hex | 1005f57dfc5 |
1101111222213 has 8 divisors (see below), whose sum is σ = 1631275884800. Its totient is φ = 734074148124.
The previous prime is 1101111222203. The next prime is 1101111222329. The reversal of 1101111222213 is 3122221111011.
It is a happy number.
It is not a de Polignac number, because 1101111222213 - 232 = 1096816254917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101111222203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20390948533 + ... + 20390948586.
It is an arithmetic number, because the mean of its divisors is an integer number (203909485600).
Almost surely, 21101111222213 is an apocalyptic number.
It is an amenable number.
1101111222213 is a deficient number, since it is larger than the sum of its proper divisors (530164662587).
1101111222213 is an equidigital number, since it uses as much as digits as its factorization.
1101111222213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40781897128 (or 40781897122 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 1101111222213 its reverse (3122221111011), we get a palindrome (4223332333224).
The spelling of 1101111222213 in words is "one trillion, one hundred one billion, one hundred eleven million, two hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •