Base | Representation |
---|---|
bin | 10100110001011111… |
… | …11010011001101001 |
3 | 1001210020122101011021 |
4 | 22120233322121221 |
5 | 140320033201101 |
6 | 5042355332441 |
7 | 543241542232 |
oct | 123057723151 |
9 | 31706571137 |
10 | 11152631401 |
11 | 480340804a |
12 | 21b2bb1121 |
13 | 10897381a2 |
14 | 77b282089 |
15 | 45418d5a1 |
hex | 298bfa669 |
11152631401 has 2 divisors, whose sum is σ = 11152631402. Its totient is φ = 11152631400.
The previous prime is 11152631387. The next prime is 11152631407. The reversal of 11152631401 is 10413625111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10506455001 + 646176400 = 102501^2 + 25420^2 .
It is a cyclic number.
It is not a de Polignac number, because 11152631401 - 29 = 11152630889 is a prime.
It is not a weakly prime, because it can be changed into another prime (11152631407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5576315700 + 5576315701.
It is an arithmetic number, because the mean of its divisors is an integer number (5576315701).
Almost surely, 211152631401 is an apocalyptic number.
It is an amenable number.
11152631401 is a deficient number, since it is larger than the sum of its proper divisors (1).
11152631401 is an equidigital number, since it uses as much as digits as its factorization.
11152631401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 25.
The spelling of 11152631401 in words is "eleven billion, one hundred fifty-two million, six hundred thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •