Base | Representation |
---|---|
bin | 10000000011001111111… |
… | …111010101000111001001 |
3 | 10220110001001012002212022 |
4 | 100003033333111013021 |
5 | 121032421241104113 |
6 | 2202413421454225 |
7 | 142455252524141 |
oct | 20031777250711 |
9 | 3813031162768 |
10 | 1103001113033 |
11 | 3958644116a6 |
12 | 159928a11375 |
13 | 8002178c2c1 |
14 | 3b557cbd921 |
15 | 1da591b4908 |
hex | 100cffd51c9 |
1103001113033 has 4 divisors (see below), whose sum is σ = 1103015758848. Its totient is φ = 1102986467220.
The previous prime is 1103001113009. The next prime is 1103001113047. The reversal of 1103001113033 is 3303111003011.
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 1103001113033 - 28 = 1103001112777 is a prime.
It is a super-2 number, since 2×11030011130332 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1103001113833) 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, 7209353 + ... + 7360758.
It is an arithmetic number, because the mean of its divisors is an integer number (275753939712).
Almost surely, 21103001113033 is an apocalyptic number.
It is an amenable number.
1103001113033 is a deficient number, since it is larger than the sum of its proper divisors (14645815).
1103001113033 is an equidigital number, since it uses as much as digits as its factorization.
1103001113033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14645814.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 1103001113033 its reverse (3303111003011), we get a palindrome (4406112116044).
The spelling of 1103001113033 in words is "one trillion, one hundred three billion, one million, one hundred thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •