Base | Representation |
---|---|
bin | 110100110101010011… |
… | …1001111101110110001 |
3 | 101211212001220120022022 |
4 | 1221222213033232301 |
5 | 3324330200311031 |
6 | 124042150521225 |
7 | 11124406403012 |
oct | 1515247175661 |
9 | 354761816268 |
10 | 113457822641 |
11 | 44131a8a479 |
12 | 19ba4966215 |
13 | a9119b98c7 |
14 | 56c4523009 |
15 | 2e4097297b |
hex | 1a6a9cfbb1 |
113457822641 has 2 divisors, whose sum is σ = 113457822642. Its totient is φ = 113457822640.
The previous prime is 113457822629. The next prime is 113457822671. The reversal of 113457822641 is 146228754311.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 113424136225 + 33686416 = 336785^2 + 5804^2 .
It is an emirp because it is prime and its reverse (146228754311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113457822641 is a prime.
It is a super-2 number, since 2×1134578226412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 113457822592 and 113457822601.
It is not a weakly prime, because it can be changed into another prime (113457822601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56728911320 + 56728911321.
It is an arithmetic number, because the mean of its divisors is an integer number (56728911321).
Almost surely, 2113457822641 is an apocalyptic number.
It is an amenable number.
113457822641 is a deficient number, since it is larger than the sum of its proper divisors (1).
113457822641 is an equidigital number, since it uses as much as digits as its factorization.
113457822641 is an evil number, because the sum of its binary digits is even.
The product of its digits is 322560, while the sum is 44.
The spelling of 113457822641 in words is "one hundred thirteen billion, four hundred fifty-seven million, eight hundred twenty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •