Base | Representation |
---|---|
bin | 110100110010011011… |
… | …1110100000010010101 |
3 | 101211121100122222201101 |
4 | 1221210313310002111 |
5 | 3324131021033412 |
6 | 124024430230101 |
7 | 11122126604605 |
oct | 1514467640225 |
9 | 354540588641 |
10 | 113361502357 |
11 | 44092681634 |
12 | 19b78655331 |
13 | a8c7a63c5c |
14 | 56b580cc05 |
15 | 2e37298457 |
hex | 1a64df4095 |
113361502357 has 2 divisors, whose sum is σ = 113361502358. Its totient is φ = 113361502356.
The previous prime is 113361502259. The next prime is 113361502361. The reversal of 113361502357 is 753205163311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109825297201 + 3536205156 = 331399^2 + 59466^2 .
It is an emirp because it is prime and its reverse (753205163311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113361502357 - 27 = 113361502229 is a prime.
It is a super-2 number, since 2×1133615023572 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113361503357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56680751178 + 56680751179.
It is an arithmetic number, because the mean of its divisors is an integer number (56680751179).
Almost surely, 2113361502357 is an apocalyptic number.
It is an amenable number.
113361502357 is a deficient number, since it is larger than the sum of its proper divisors (1).
113361502357 is an equidigital number, since it uses as much as digits as its factorization.
113361502357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56700, while the sum is 37.
Adding to 113361502357 its reverse (753205163311), we get a palindrome (866566665668).
The spelling of 113361502357 in words is "one hundred thirteen billion, three hundred sixty-one million, five hundred two thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •