Base | Representation |
---|---|
bin | 10000000110001000101… |
… | …110111100000100100001 |
3 | 10220202001001102102012102 |
4 | 100012020232330010201 |
5 | 121110243223213441 |
6 | 2204045142340145 |
7 | 142625126660435 |
oct | 20061056740441 |
9 | 3822031372172 |
10 | 1106100601121 |
11 | 397104a539aa |
12 | 15a452a2a655 |
13 | 803c6968319 |
14 | 3b76d7c29c5 |
15 | 1db8b35b69b |
hex | 10188bbc121 |
1106100601121 has 8 divisors (see below), whose sum is σ = 1131096057984. Its totient is φ = 1081166036080.
The previous prime is 1106100601051. The next prime is 1106100601127. The reversal of 1106100601121 is 1211060016011.
It is a happy number.
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 1106100601121 - 214 = 1106100584737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1106100601093 and 1106100601102.
It is not an unprimeable number, because it can be changed into a prime (1106100601127) 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, 15186215 + ... + 15258876.
It is an arithmetic number, because the mean of its divisors is an integer number (141387007248).
Almost surely, 21106100601121 is an apocalyptic number.
It is an amenable number.
1106100601121 is a deficient number, since it is larger than the sum of its proper divisors (24995456863).
1106100601121 is an equidigital number, since it uses as much as digits as its factorization.
1106100601121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30445911.
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 1106100601121 its reverse (1211060016011), we get a palindrome (2317160617132).
The spelling of 1106100601121 in words is "one trillion, one hundred six billion, one hundred million, six hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •