Base | Representation |
---|---|
bin | 1010000000010111000100… |
… | …1111011010101111000101 |
3 | 1102221201022021202002001001 |
4 | 2200011301033122233011 |
5 | 2420221141121042013 |
6 | 35221533233133301 |
7 | 2213550513354556 |
oct | 240056117325705 |
9 | 42851267662031 |
10 | 11001311112133 |
11 | 35616a2356961 |
12 | 12981649ba231 |
13 | 61a55ac4cb54 |
14 | 2a067574a32d |
15 | 141281841ddd |
hex | a01713dabc5 |
11001311112133 has 2 divisors, whose sum is σ = 11001311112134. Its totient is φ = 11001311112132.
The previous prime is 11001311112119. The next prime is 11001311112163. The reversal of 11001311112133 is 33121111310011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10892389331044 + 108921781089 = 3300362^2 + 330033^2 .
It is a cyclic number.
It is not a de Polignac number, because 11001311112133 - 29 = 11001311111621 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11001311112133.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11001311112163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5500655556066 + 5500655556067.
It is an arithmetic number, because the mean of its divisors is an integer number (5500655556067).
Almost surely, 211001311112133 is an apocalyptic number.
It is an amenable number.
11001311112133 is a deficient number, since it is larger than the sum of its proper divisors (1).
11001311112133 is an equidigital number, since it uses as much as digits as its factorization.
11001311112133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 19.
Adding to 11001311112133 its reverse (33121111310011), we get a palindrome (44122422422144).
The spelling of 11001311112133 in words is "eleven trillion, one billion, three hundred eleven million, one hundred twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •