Base | Representation |
---|---|
bin | 10000000001011010100… |
… | …100101101010111010001 |
3 | 10220020221202110011111002 |
4 | 100001122210231113101 |
5 | 121014402441401314 |
6 | 2201450131431345 |
7 | 142355402533103 |
oct | 20013244552721 |
9 | 3806852404432 |
10 | 1101031200209 |
11 | 394a43454a76 |
12 | 159479155555 |
13 | 7ca9961a805 |
14 | 3b40c417573 |
15 | 1d991296ade |
hex | 1005a92d5d1 |
1101031200209 has 8 divisors (see below), whose sum is σ = 1124212078080. Its totient is φ = 1078090538976.
The previous prime is 1101031200187. The next prime is 1101031200211. The reversal of 1101031200209 is 9020021301011.
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 1101031200209 - 216 = 1101031134673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101031200239) 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, 60044897 + ... + 60063230.
It is an arithmetic number, because the mean of its divisors is an integer number (140526509760).
Almost surely, 21101031200209 is an apocalyptic number.
It is an amenable number.
1101031200209 is a deficient number, since it is larger than the sum of its proper divisors (23180877871).
1101031200209 is a wasteful number, since it uses less digits than its factorization.
1101031200209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120108319.
The product of its (nonzero) digits is 108, while the sum is 20.
The spelling of 1101031200209 in words is "one trillion, one hundred one billion, thirty-one million, two hundred thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •