Base | Representation |
---|---|
bin | 10000010100001110000… |
… | …011101001010110101101 |
3 | 10222012001220120100212122 |
4 | 100110032003221112231 |
5 | 121332230402113401 |
6 | 2215025445042325 |
7 | 144001635211340 |
oct | 20241603512655 |
9 | 3865056510778 |
10 | 1121222301101 |
11 | 3a2564838a11 |
12 | 1613730b63a5 |
13 | 81966784ca6 |
14 | 3c3a5c46457 |
15 | 1e273bb021b |
hex | 1050e0e95ad |
1121222301101 has 8 divisors (see below), whose sum is σ = 1325583016320. Its totient is φ = 927908111088.
The previous prime is 1121222301071. The next prime is 1121222301151. The reversal of 1121222301101 is 1011032221211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1121222301101 - 26 = 1121222301037 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1121222301101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121222301151) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2761631081 + ... + 2761631486.
It is an arithmetic number, because the mean of its divisors is an integer number (165697877040).
Almost surely, 21121222301101 is an apocalyptic number.
It is an amenable number.
1121222301101 is a deficient number, since it is larger than the sum of its proper divisors (204360715219).
1121222301101 is an equidigital number, since it uses as much as digits as its factorization.
1121222301101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5523262603.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 1121222301101 its reverse (1011032221211), we get a palindrome (2132254522312).
The spelling of 1121222301101 in words is "one trillion, one hundred twenty-one billion, two hundred twenty-two million, three hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •