Base | Representation |
---|---|
bin | 10000000001011001011… |
… | …000011011010011100101 |
3 | 10220020220100211012212212 |
4 | 100001121120123103211 |
5 | 121014332332001201 |
6 | 2201444135053205 |
7 | 142355040546062 |
oct | 20013130332345 |
9 | 3806810735785 |
10 | 1101011203301 |
11 | 394a33136aa9 |
12 | 159472511205 |
13 | 7ca95438919 |
14 | 3b4098cdc69 |
15 | 1d98e646abb |
hex | 1005961b4e5 |
1101011203301 has 8 divisors (see below), whose sum is σ = 1126844784000. Its totient is φ = 1075277948128.
The previous prime is 1101011203189. The next prime is 1101011203307. The reversal of 1101011203301 is 1033021101011.
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 1101011203301 - 238 = 826133296357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101011203307) 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, 25059176 + ... + 25103073.
It is an arithmetic number, because the mean of its divisors is an integer number (140855598000).
Almost surely, 21101011203301 is an apocalyptic number.
It is an amenable number.
1101011203301 is a deficient number, since it is larger than the sum of its proper divisors (25833580699).
1101011203301 is an equidigital number, since it uses as much as digits as its factorization.
1101011203301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50162763.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 1101011203301 its reverse (1033021101011), we get a palindrome (2134032304312).
The spelling of 1101011203301 in words is "one trillion, one hundred one billion, eleven million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •