Base | Representation |
---|---|
bin | 110100101011111000… |
… | …0001100011110010101 |
3 | 101211001000111201002112 |
4 | 1221113300030132111 |
5 | 3323203144321433 |
6 | 123550524520405 |
7 | 11113515021251 |
oct | 1512760143625 |
9 | 354030451075 |
10 | 113141401493 |
11 | 43a8a40a59a |
12 | 19b169b0105 |
13 | a89128c663 |
14 | 56944b7261 |
15 | 2e22cbd348 |
hex | 1a57c0c795 |
113141401493 has 2 divisors, whose sum is σ = 113141401494. Its totient is φ = 113141401492.
The previous prime is 113141401421. The next prime is 113141401511. The reversal of 113141401493 is 394104141311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105509981329 + 7631420164 = 324823^2 + 87358^2 .
It is a cyclic number.
It is not a de Polignac number, because 113141401493 - 28 = 113141401237 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113141401393) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56570700746 + 56570700747.
It is an arithmetic number, because the mean of its divisors is an integer number (56570700747).
Almost surely, 2113141401493 is an apocalyptic number.
It is an amenable number.
113141401493 is a deficient number, since it is larger than the sum of its proper divisors (1).
113141401493 is an equidigital number, since it uses as much as digits as its factorization.
113141401493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 113141401493 in words is "one hundred thirteen billion, one hundred forty-one million, four hundred one thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •