Base | Representation |
---|---|
bin | 1010000010000110000101… |
… | …1110000111100000000001 |
3 | 1110001120020010001112020022 |
4 | 2200201201132013200001 |
5 | 2421213203443113441 |
6 | 35243342250423225 |
7 | 2215654135654202 |
oct | 240414136074001 |
9 | 43046203045208 |
10 | 11031111301121 |
11 | 35732a4826a1a |
12 | 12a1aa0a31b15 |
13 | 6202c9ac5982 |
14 | 2a1ca14215a9 |
15 | 141e27b4c84b |
hex | a0861787801 |
11031111301121 has 2 divisors, whose sum is σ = 11031111301122. Its totient is φ = 11031111301120.
The previous prime is 11031111301069. The next prime is 11031111301169. The reversal of 11031111301121 is 12110311113011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5683270049521 + 5347841251600 = 2383961^2 + 2312540^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11031111301121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11031111301121.
It is not a weakly prime, because it can be changed into another prime (11031111361121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515555650560 + 5515555650561.
It is an arithmetic number, because the mean of its divisors is an integer number (5515555650561).
Almost surely, 211031111301121 is an apocalyptic number.
It is an amenable number.
11031111301121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031111301121 is an equidigital number, since it uses as much as digits as its factorization.
11031111301121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 11031111301121 its reverse (12110311113011), we get a palindrome (23141422414132).
The spelling of 11031111301121 in words is "eleven trillion, thirty-one billion, one hundred eleven million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •