Base | Representation |
---|---|
bin | 110100101011111111… |
… | …1101010001001100001 |
3 | 101211001022010122201212 |
4 | 1221113333222021201 |
5 | 3323210214031301 |
6 | 123551151435505 |
7 | 11113564333532 |
oct | 1512777521141 |
9 | 354038118655 |
10 | 113145455201 |
11 | 43a91729169 |
12 | 19b18225b95 |
13 | a89207b7bc |
14 | 5694c50689 |
15 | 2e2331e4bb |
hex | 1a57fea261 |
113145455201 has 2 divisors, whose sum is σ = 113145455202. Its totient is φ = 113145455200.
The previous prime is 113145455113. The next prime is 113145455233. The reversal of 113145455201 is 102554541311.
It is an a-pointer prime, because the next prime (113145455233) can be obtained adding 113145455201 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109154248225 + 3991206976 = 330385^2 + 63176^2 .
It is an emirp because it is prime and its reverse (102554541311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113145455201 - 214 = 113145438817 is a prime.
It is not a weakly prime, because it can be changed into another prime (113145451201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56572727600 + 56572727601.
It is an arithmetic number, because the mean of its divisors is an integer number (56572727601).
Almost surely, 2113145455201 is an apocalyptic number.
It is an amenable number.
113145455201 is a deficient number, since it is larger than the sum of its proper divisors (1).
113145455201 is an equidigital number, since it uses as much as digits as its factorization.
113145455201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12000, while the sum is 32.
Adding to 113145455201 its reverse (102554541311), we get a palindrome (215699996512).
The spelling of 113145455201 in words is "one hundred thirteen billion, one hundred forty-five million, four hundred fifty-five thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •