Base | Representation |
---|---|
bin | 110100001010001100… |
… | …0000110000000110101 |
3 | 101201010020110212121200 |
4 | 1220110120012000311 |
5 | 3313344304310401 |
6 | 123242424403113 |
7 | 11043510606444 |
oct | 1502430060065 |
9 | 351106425550 |
10 | 112011010101 |
11 | 4355a327831 |
12 | 19860316499 |
13 | a74102a803 |
14 | 55c8306d5b |
15 | 2da8932686 |
hex | 1a14606035 |
112011010101 has 12 divisors (see below), whose sum is σ = 163225485228. Its totient is φ = 74013174144.
The previous prime is 112011010063. The next prime is 112011010103. The reversal of 112011010101 is 101010110211.
It can be written as a sum of positive squares in 2 ways, for example, as 3289137201 + 108721872900 = 57351^2 + 329730^2 .
It is not a de Polignac number, because 112011010101 - 218 = 112010747957 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011010103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55068310 + ... + 55070343.
It is an arithmetic number, because the mean of its divisors is an integer number (13602123769).
Almost surely, 2112011010101 is an apocalyptic number.
It is an amenable number.
112011010101 is a deficient number, since it is larger than the sum of its proper divisors (51214475127).
112011010101 is a wasteful number, since it uses less digits than its factorization.
112011010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110138772 (or 110138769 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 112011010101 its reverse (101010110211), we get a palindrome (213021120312).
The spelling of 112011010101 in words is "one hundred twelve billion, eleven million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •