Base | Representation |
---|---|
bin | 110100101011010001… |
… | …0011101000011111001 |
3 | 101210222121011022221221 |
4 | 1221112202131003321 |
5 | 3323132440202301 |
6 | 123544520032041 |
7 | 11113146552355 |
oct | 1512642350371 |
9 | 353877138857 |
10 | 113121022201 |
11 | 43a79960300 |
12 | 19b10002621 |
13 | a889ca56c5 |
14 | 56918d0465 |
15 | 2e210e4da1 |
hex | 1a5689d0f9 |
113121022201 has 6 divisors (see below), whose sum is σ = 124339636106. Its totient is φ = 102837292800.
The previous prime is 113121022181. The next prime is 113121022211. The reversal of 113121022201 is 102220121311.
It can be written as a sum of positive squares in only one way, i.e., 66594963600 + 46526058601 = 258060^2 + 215699^2 .
It is not a de Polignac number, because 113121022201 - 225 = 113087467769 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113121022211) 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 in 5 ways as a sum of consecutive naturals, for example, 467442120 + ... + 467442361.
Almost surely, 2113121022201 is an apocalyptic number.
113121022201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
113121022201 is a deficient number, since it is larger than the sum of its proper divisors (11218613905).
113121022201 is an equidigital number, since it uses as much as digits as its factorization.
113121022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934884503 (or 934884492 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 113121022201 its reverse (102220121311), we get a palindrome (215341143512).
The spelling of 113121022201 in words is "one hundred thirteen billion, one hundred twenty-one million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •