Base | Representation |
---|---|
bin | 1010011010010000001010… |
… | …1001001101011100100101 |
3 | 1111112020110122002200111122 |
4 | 2212210002221031130211 |
5 | 3000013134320420003 |
6 | 40202140332543325 |
7 | 2260645553263031 |
oct | 246440251153445 |
9 | 44466418080448 |
10 | 11446132201253 |
11 | 3713306255972 |
12 | 134a406621b45 |
13 | 65049a3ba0a9 |
14 | 2b7dd24c91c1 |
15 | 14cb180d8238 |
hex | a6902a4d725 |
11446132201253 has 2 divisors, whose sum is σ = 11446132201254. Its totient is φ = 11446132201252.
The previous prime is 11446132201177. The next prime is 11446132201261. The reversal of 11446132201253 is 35210223164411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10363654263169 + 1082477938084 = 3219263^2 + 1040422^2 .
It is a cyclic number.
It is not a de Polignac number, because 11446132201253 - 228 = 11445863765797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11446132221253) 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, 5723066100626 + 5723066100627.
It is an arithmetic number, because the mean of its divisors is an integer number (5723066100627).
Almost surely, 211446132201253 is an apocalyptic number.
It is an amenable number.
11446132201253 is a deficient number, since it is larger than the sum of its proper divisors (1).
11446132201253 is an equidigital number, since it uses as much as digits as its factorization.
11446132201253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 35.
Adding to 11446132201253 its reverse (35210223164411), we get a palindrome (46656355365664).
The spelling of 11446132201253 in words is "eleven trillion, four hundred forty-six billion, one hundred thirty-two million, two hundred one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •