Base | Representation |
---|---|
bin | 10000010100000111010… |
… | …111101000110001111000 |
3 | 10222011210002110000102111 |
4 | 100110013113220301320 |
5 | 121332013141213422 |
6 | 2215010400142104 |
7 | 143666103424561 |
oct | 20240727506170 |
9 | 3864702400374 |
10 | 1121110101112 |
11 | 3a2507474451 |
12 | 161341607934 |
13 | 8194945c471 |
14 | 3c394d9b168 |
15 | 1e268deaa77 |
hex | 105075e8c78 |
1121110101112 has 8 divisors (see below), whose sum is σ = 2102081439600. Its totient is φ = 560555050552.
The previous prime is 1121110101109. The next prime is 1121110101113. The reversal of 1121110101112 is 2111010111211.
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 1121110101092 and 1121110101101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121110101113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 70069381312 + ... + 70069381327.
It is an arithmetic number, because the mean of its divisors is an integer number (262760179950).
Almost surely, 21121110101112 is an apocalyptic number.
It is an amenable number.
1121110101112 is a deficient number, since it is larger than the sum of its proper divisors (980971338488).
1121110101112 is a wasteful number, since it uses less digits than its factorization.
1121110101112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140138762645 (or 140138762641 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1121110101112 its reverse (2111010111211), we get a palindrome (3232120212323).
It can be divided in two parts, 11 and 21110101112, that multiplied together give a palindrome (232211112232).
The spelling of 1121110101112 in words is "one trillion, one hundred twenty-one billion, one hundred ten million, one hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •