Base | Representation |
---|---|
bin | 11001001111010001111011… |
… | …001001111110100110110001 |
3 | 112120000121111112212220010111 |
4 | 121033101323021332212301 |
5 | 104022120424424323441 |
6 | 1032025125304101321 |
7 | 32244400144635001 |
oct | 3117217311764661 |
9 | 476017445786114 |
10 | 111001201011121 |
11 | 324063881a2563 |
12 | 10548939764841 |
13 | 49c24a3326765 |
14 | 1d5a6b5a9c001 |
15 | cc75e1614081 |
hex | 64f47b27e9b1 |
111001201011121 has 8 divisors (see below), whose sum is σ = 111026348021088. Its totient is φ = 110976055080000.
The previous prime is 111001201011119. The next prime is 111001201011199. The reversal of 111001201011121 is 121110102100111.
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 111001201011121 - 21 = 111001201011119 is a prime.
It is a super-2 number, since 2×1110012010111212 (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 (111001201011721) 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, 227030521 + ... + 227518921.
It is an arithmetic number, because the mean of its divisors is an integer number (13878293502636).
Almost surely, 2111001201011121 is an apocalyptic number.
It is an amenable number.
111001201011121 is a deficient number, since it is larger than the sum of its proper divisors (25147009967).
111001201011121 is an equidigital number, since it uses as much as digits as its factorization.
111001201011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539423.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 111001201011121 its reverse (121110102100111), we get a palindrome (232111303111232).
The spelling of 111001201011121 in words is "one hundred eleven trillion, one billion, two hundred one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •