Base | Representation |
---|---|
bin | 110100101111010011… |
… | …1010011011011100001 |
3 | 101211100001002212221001 |
4 | 1221132213103123201 |
5 | 3323422131324301 |
6 | 124010200032001 |
7 | 11116413314131 |
oct | 1513647233341 |
9 | 354301085831 |
10 | 113256511201 |
11 | 44039391189 |
12 | 19b49462601 |
13 | a8ac093702 |
14 | 56a58bcac1 |
15 | 2e2ce59c01 |
hex | 1a5e9d36e1 |
113256511201 has 2 divisors, whose sum is σ = 113256511202. Its totient is φ = 113256511200.
The previous prime is 113256511139. The next prime is 113256511211. The reversal of 113256511201 is 102115652311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97468840000 + 15787671201 = 312200^2 + 125649^2 .
It is an emirp because it is prime and its reverse (102115652311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113256511201 - 27 = 113256511073 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113256511201.
It is not a weakly prime, because it can be changed into another prime (113256511211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56628255600 + 56628255601.
It is an arithmetic number, because the mean of its divisors is an integer number (56628255601).
Almost surely, 2113256511201 is an apocalyptic number.
It is an amenable number.
113256511201 is a deficient number, since it is larger than the sum of its proper divisors (1).
113256511201 is an equidigital number, since it uses as much as digits as its factorization.
113256511201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 28.
The spelling of 113256511201 in words is "one hundred thirteen billion, two hundred fifty-six million, five hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •