Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0001000011101110101 |
3 | 101201002110210000110021 |
4 | 1220103232020131311 |
5 | 3313334000310401 |
6 | 123241352525141 |
7 | 11043315243460 |
oct | 1502356103565 |
9 | 351073700407 |
10 | 112000010101 |
11 | 435540a4321 |
12 | 198586b07b1 |
13 | a73b978a35 |
14 | 55c6a822d7 |
15 | 2da79ad2a1 |
hex | 1a13b88775 |
112000010101 has 16 divisors (see below), whose sum is σ = 129835180800. Its totient is φ = 94624306560.
The previous prime is 112000010053. The next prime is 112000010119. The reversal of 112000010101 is 101010000211.
It is not a de Polignac number, because 112000010101 - 211 = 112000008053 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112000010401) 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 15 ways as a sum of consecutive naturals, for example, 2135545 + ... + 2187361.
It is an arithmetic number, because the mean of its divisors is an integer number (8114698800).
Almost surely, 2112000010101 is an apocalyptic number.
It is an amenable number.
112000010101 is a deficient number, since it is larger than the sum of its proper divisors (17835170699).
112000010101 is an equidigital number, since it uses as much as digits as its factorization.
112000010101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56244.
The product of its (nonzero) digits is 2, while the sum is 7.
Adding to 112000010101 its reverse (101010000211), we get a palindrome (213010010312).
The spelling of 112000010101 in words is "one hundred twelve billion, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •