Base | Representation |
---|---|
bin | 110100101101111101… |
… | …0000101100000011011 |
3 | 101211012212122220221102 |
4 | 1221123322011200123 |
5 | 3323324020301014 |
6 | 124001454502015 |
7 | 11115322333352 |
oct | 1513372054033 |
9 | 354185586842 |
10 | 113211103259 |
11 | 44015797561 |
12 | 19b3620490b |
13 | a8a28554c7 |
14 | 569d85c999 |
15 | 2e28e8a8de |
hex | 1a5be8581b |
113211103259 has 2 divisors, whose sum is σ = 113211103260. Its totient is φ = 113211103258.
The previous prime is 113211103249. The next prime is 113211103277. The reversal of 113211103259 is 952301112311.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 113211103259 - 28 = 113211103003 is a prime.
It is a super-2 number, since 2×1132111032592 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (113211103249) 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, 56605551629 + 56605551630.
It is an arithmetic number, because the mean of its divisors is an integer number (56605551630).
Almost surely, 2113211103259 is an apocalyptic number.
113211103259 is a deficient number, since it is larger than the sum of its proper divisors (1).
113211103259 is an equidigital number, since it uses as much as digits as its factorization.
113211103259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 29.
The spelling of 113211103259 in words is "one hundred thirteen billion, two hundred eleven million, one hundred three thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •