Base | Representation |
---|---|
bin | 1101100100111… |
… | …01011001111111 |
3 | 21221022021000002 |
4 | 12302131121333 |
5 | 213124002233 |
6 | 15145024515 |
7 | 2552025365 |
oct | 662353177 |
9 | 257267002 |
10 | 113890943 |
11 | 59319a51 |
12 | 3218513b |
13 | 1a7983ba |
14 | 111a9635 |
15 | 9eea6e8 |
hex | 6c9d67f |
113890943 has 2 divisors, whose sum is σ = 113890944. Its totient is φ = 113890942.
The previous prime is 113890937. The next prime is 113890949. The reversal of 113890943 is 349098311.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (113890937) and next prime (113890949).
It is an emirp because it is prime and its reverse (349098311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 113890943 - 24 = 113890927 is a prime.
It is a super-3 number, since 3×1138909433 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 113890897 and 113890906.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113890949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56945471 + 56945472.
It is an arithmetic number, because the mean of its divisors is an integer number (56945472).
Almost surely, 2113890943 is an apocalyptic number.
113890943 is a deficient number, since it is larger than the sum of its proper divisors (1).
113890943 is an equidigital number, since it uses as much as digits as its factorization.
113890943 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 113890943 is about 10671.9699680987. The cubic root of 113890943 is about 484.7260904199.
The spelling of 113890943 in words is "one hundred thirteen million, eight hundred ninety thousand, nine hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •