Base | Representation |
---|---|
bin | 110101000000000001… |
… | …1001101010011011101 |
3 | 101212210010122202120222 |
4 | 1222000003031103131 |
5 | 3331044233134034 |
6 | 124141555251125 |
7 | 11136334366022 |
oct | 1520003152335 |
9 | 355703582528 |
10 | 113817474269 |
11 | 442a6aa7024 |
12 | 1a0852a9aa5 |
13 | a96b371c15 |
14 | 571a1c3549 |
15 | 2e6231612e |
hex | 1a800cd4dd |
113817474269 has 2 divisors, whose sum is σ = 113817474270. Its totient is φ = 113817474268.
The previous prime is 113817474257. The next prime is 113817474271. The reversal of 113817474269 is 962474718311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88786120900 + 25031353369 = 297970^2 + 158213^2 .
It is a cyclic number.
It is not a de Polignac number, because 113817474269 - 224 = 113800697053 is a prime.
It is a super-2 number, since 2×1138174742692 (a number of 23 digits) contains 22 as substring.
Together with 113817474271, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113817474269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113817474289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56908737134 + 56908737135.
It is an arithmetic number, because the mean of its divisors is an integer number (56908737135).
Almost surely, 2113817474269 is an apocalyptic number.
It is an amenable number.
113817474269 is a deficient number, since it is larger than the sum of its proper divisors (1).
113817474269 is an equidigital number, since it uses as much as digits as its factorization.
113817474269 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2032128, while the sum is 53.
The spelling of 113817474269 in words is "one hundred thirteen billion, eight hundred seventeen million, four hundred seventy-four thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •