Base | Representation |
---|---|
bin | 1010001101110111101011… |
… | …1000101111001110100001 |
3 | 1110202220101001010202021111 |
4 | 2203131322320233032201 |
5 | 2433022001200013042 |
6 | 35520315300423321 |
7 | 2236405103340211 |
oct | 243357270571641 |
9 | 43686331122244 |
10 | 11233401172897 |
11 | 3641071120732 |
12 | 13151373a7b41 |
13 | 6363c7651c57 |
14 | 2ab9b1696241 |
15 | 147317142517 |
hex | a377ae2f3a1 |
11233401172897 has 2 divisors, whose sum is σ = 11233401172898. Its totient is φ = 11233401172896.
The previous prime is 11233401172813. The next prime is 11233401172967. The reversal of 11233401172897 is 79827110433211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11219759867281 + 13641305616 = 3349591^2 + 116796^2 .
It is a cyclic number.
It is not a de Polignac number, because 11233401172897 - 27 = 11233401172769 is a prime.
It is a super-2 number, since 2×112334011728972 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11233401172897.
It is not a weakly prime, because it can be changed into another prime (11233401182897) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5616700586448 + 5616700586449.
It is an arithmetic number, because the mean of its divisors is an integer number (5616700586449).
Almost surely, 211233401172897 is an apocalyptic number.
It is an amenable number.
11233401172897 is a deficient number, since it is larger than the sum of its proper divisors (1).
11233401172897 is an equidigital number, since it uses as much as digits as its factorization.
11233401172897 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 508032, while the sum is 49.
The spelling of 11233401172897 in words is "eleven trillion, two hundred thirty-three billion, four hundred one million, one hundred seventy-two thousand, eight hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •