Base | Representation |
---|---|
bin | 110100101101101010… |
… | …0011001001110101001 |
3 | 101211012012001221011221 |
4 | 1221123110121032221 |
5 | 3323314003110234 |
6 | 124000503022041 |
7 | 11115142341601 |
oct | 1513324311651 |
9 | 354165057157 |
10 | 113201222569 |
11 | 44010158aa6 |
12 | 19b32a3a921 |
13 | a8a07a6046 |
14 | 569c409c01 |
15 | 2e28187eb4 |
hex | 1a5b5193a9 |
113201222569 has 2 divisors, whose sum is σ = 113201222570. Its totient is φ = 113201222568.
The previous prime is 113201222521. The next prime is 113201222573. The reversal of 113201222569 is 965222102311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57966822169 + 55234400400 = 240763^2 + 235020^2 .
It is an emirp because it is prime and its reverse (965222102311) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113201222569 is a prime.
It is a super-2 number, since 2×1132012225692 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (113201232569) 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, 56600611284 + 56600611285.
It is an arithmetic number, because the mean of its divisors is an integer number (56600611285).
Almost surely, 2113201222569 is an apocalyptic number.
It is an amenable number.
113201222569 is a deficient number, since it is larger than the sum of its proper divisors (1).
113201222569 is an equidigital number, since it uses as much as digits as its factorization.
113201222569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 34.
The spelling of 113201222569 in words is "one hundred thirteen billion, two hundred one million, two hundred twenty-two thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •