Base | Representation |
---|---|
bin | 101111000101010111… |
… | …1101011011000110101 |
3 | 100122222200001220100201 |
4 | 1132022233223120311 |
5 | 3124034133031401 |
6 | 114241125040501 |
7 | 10206435560065 |
oct | 1361257533065 |
9 | 318880056321 |
10 | 101112002101 |
11 | 399770a8800 |
12 | 1771a256131 |
13 | 96c5003356 |
14 | 4c72a053a5 |
15 | 296bb91b01 |
hex | 178abeb635 |
101112002101 has 12 divisors (see below), whose sum is σ = 111176495500. Its totient is φ = 91889519040.
The previous prime is 101112002063. The next prime is 101112002111. The reversal of 101112002101 is 101200211101.
It can be written as a sum of positive squares in 2 ways, for example, as 40561557201 + 60550444900 = 201399^2 + 246070^2 .
It is not a de Polignac number, because 101112002101 - 215 = 101111969333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101112002111) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 231895 + ... + 505963.
Almost surely, 2101112002101 is an apocalyptic number.
101112002101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101112002101 is a deficient number, since it is larger than the sum of its proper divisors (10064493399).
101112002101 is a wasteful number, since it uses less digits than its factorization.
101112002101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 277140 (or 277129 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101112002101 its reverse (101200211101), we get a palindrome (202312213202).
It can be divided in two parts, 10 and 1112002101, that added together give a palindrome (1112002111).
The spelling of 101112002101 in words is "one hundred one billion, one hundred twelve million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •