Base | Representation |
---|---|
bin | 11001100010100001010111… |
… | …111011100011001100101001 |
3 | 112201201000111001100202221001 |
4 | 121202201113323203030221 |
5 | 104210301421222002244 |
6 | 1034520403554115001 |
7 | 32442050022333103 |
oct | 3142412773431451 |
9 | 481630431322831 |
10 | 112323459953449 |
11 | 32876125971558 |
12 | 1072105757ba61 |
13 | 4a8a097ac6894 |
14 | 1da46ad550573 |
15 | cebbce7665d4 |
hex | 662857ee3329 |
112323459953449 has 2 divisors, whose sum is σ = 112323459953450. Its totient is φ = 112323459953448.
The previous prime is 112323459953359. The next prime is 112323459953459. The reversal of 112323459953449 is 944359954323211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111806832515625 + 516627437824 = 10573875^2 + 718768^2 .
It is a cyclic number.
It is not a de Polignac number, because 112323459953449 - 219 = 112323459429161 is a prime.
It is a super-3 number, since 3×1123234599534493 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (112323459953459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56161729976724 + 56161729976725.
It is an arithmetic number, because the mean of its divisors is an integer number (56161729976725).
Almost surely, 2112323459953449 is an apocalyptic number.
It is an amenable number.
112323459953449 is a deficient number, since it is larger than the sum of its proper divisors (1).
112323459953449 is an equidigital number, since it uses as much as digits as its factorization.
112323459953449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 125971200, while the sum is 64.
The spelling of 112323459953449 in words is "one hundred twelve trillion, three hundred twenty-three billion, four hundred fifty-nine million, nine hundred fifty-three thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •