Base | Representation |
---|---|
bin | 10000000001100101100… |
… | …010010110010111110001 |
3 | 10220021102120112211021002 |
4 | 100001211202112113301 |
5 | 121020242033143441 |
6 | 2201520302011345 |
7 | 142363065112610 |
oct | 20014542262761 |
9 | 3807376484232 |
10 | 1101215131121 |
11 | 395028261a96 |
12 | 15950a876b55 |
13 | 7cac8769981 |
14 | 3b428a15877 |
15 | 1d9a24c9b9b |
hex | 100658965f1 |
1101215131121 has 8 divisors (see below), whose sum is σ = 1258580476800. Its totient is φ = 943862010048.
The previous prime is 1101215131061. The next prime is 1101215131129. The reversal of 1101215131121 is 1211315121011.
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 1101215131121 - 26 = 1101215131057 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 = 1101215131093 and 1101215131102.
It is not an unprimeable number, because it can be changed into a prime (1101215131129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2862296 + ... + 3224153.
It is an arithmetic number, because the mean of its divisors is an integer number (157322559600).
Almost surely, 21101215131121 is an apocalyptic number.
It is an amenable number.
1101215131121 is a deficient number, since it is larger than the sum of its proper divisors (157365345679).
1101215131121 is an equidigital number, since it uses as much as digits as its factorization.
1101215131121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6112303.
The product of its (nonzero) digits is 60, while the sum is 20.
The spelling of 1101215131121 in words is "one trillion, one hundred one billion, two hundred fifteen million, one hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •