Base | Representation |
---|---|
bin | 11001011111100100110100… |
… | …011111110010100110000011 |
3 | 112200222122220102000200021112 |
4 | 121133210310133302212003 |
5 | 104143442303003323021 |
6 | 1034243402141513535 |
7 | 32421321644245130 |
oct | 3137446437624603 |
9 | 480878812020245 |
10 | 112121002011011 |
11 | 327a8282712874 |
12 | 106a99748728ab |
13 | 4a73c714b24c6 |
14 | 1d98984c49587 |
15 | ce67d0622d5b |
hex | 65f9347f2983 |
112121002011011 has 8 divisors (see below), whose sum is σ = 128140135499520. Its totient is φ = 96102330394248.
The previous prime is 112121002010977. The next prime is 112121002011037. The reversal of 112121002011011 is 110110200121211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112121002011011 - 246 = 41752257833347 is a prime.
It is a super-2 number, since 2×1121210020110112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112121002011091) 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, 114947591 + ... + 115918896.
It is an arithmetic number, because the mean of its divisors is an integer number (16017516937440).
Almost surely, 2112121002011011 is an apocalyptic number.
112121002011011 is a deficient number, since it is larger than the sum of its proper divisors (16019133488509).
112121002011011 is an equidigital number, since it uses as much as digits as its factorization.
112121002011011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230935873.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112121002011011 its reverse (110110200121211), we get a palindrome (222231202132222).
The spelling of 112121002011011 in words is "one hundred twelve trillion, one hundred twenty-one billion, two million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •