Base | Representation |
---|---|
bin | 110100101010101101… |
… | …0101100100000110010 |
3 | 101210221021202122000022 |
4 | 1221111122230200302 |
5 | 3323113131223442 |
6 | 123543004523442 |
7 | 11112530634515 |
oct | 1512532544062 |
9 | 353837678008 |
10 | 113102211122 |
11 | 43a6a28225a |
12 | 19b05850582 |
13 | a88611a4a4 |
14 | 568d1d4d7c |
15 | 2e1e62b3d2 |
hex | 1a556ac832 |
113102211122 has 4 divisors (see below), whose sum is σ = 169653316686. Its totient is φ = 56551105560.
The previous prime is 113102211121. The next prime is 113102211127. The reversal of 113102211122 is 221112201311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 110668663561 + 2433547561 = 332669^2 + 49331^2 .
It is a super-2 number, since 2×1131022111222 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 113102211122.
It is not an unprimeable number, because it can be changed into a prime (113102211121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28275552779 + ... + 28275552782.
Almost surely, 2113102211122 is an apocalyptic number.
113102211122 is a deficient number, since it is larger than the sum of its proper divisors (56551105564).
113102211122 is an equidigital number, since it uses as much as digits as its factorization.
113102211122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56551105563.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 113102211122 its reverse (221112201311), we get a palindrome (334214412433).
The spelling of 113102211122 in words is "one hundred thirteen billion, one hundred two million, two hundred eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •