Base | Representation |
---|---|
bin | 10000000001011111011… |
… | …101001101010100100001 |
3 | 10220021011110121010100122 |
4 | 100001133131031110201 |
5 | 121020034424320113 |
6 | 2201502215330025 |
7 | 142360416043313 |
oct | 20013735152441 |
9 | 3807143533318 |
10 | 1101113120033 |
11 | 394a85717603 |
12 | 1594a0680915 |
13 | 7cab05a0994 |
14 | 3b41925d7b3 |
15 | 1d998579408 |
hex | 1005f74d521 |
1101113120033 has 4 divisors (see below), whose sum is σ = 1159066442160. Its totient is φ = 1043159797908.
The previous prime is 1101113120027. The next prime is 1101113120053. The reversal of 1101113120033 is 3300213111011.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1101113120033 - 230 = 1100039378209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101113119993 and 1101113120020.
It is not an unprimeable number, because it can be changed into a prime (1101113120053) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 28976661035 + ... + 28976661072.
It is an arithmetic number, because the mean of its divisors is an integer number (289766610540).
Almost surely, 21101113120033 is an apocalyptic number.
It is an amenable number.
1101113120033 is a deficient number, since it is larger than the sum of its proper divisors (57953322127).
1101113120033 is an equidigital number, since it uses as much as digits as its factorization.
1101113120033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57953322126.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 1101113120033 its reverse (3300213111011), we get a palindrome (4401326231044).
The spelling of 1101113120033 in words is "one trillion, one hundred one billion, one hundred thirteen million, one hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •