Base | Representation |
---|---|
bin | 110100001001110111… |
… | …0011110111100111001 |
3 | 101201002110221200210101 |
4 | 1220103232132330321 |
5 | 3313334011232301 |
6 | 123241354515401 |
7 | 11043316106131 |
oct | 1502356367471 |
9 | 351073850711 |
10 | 112000102201 |
11 | 43554157539 |
12 | 19858735b61 |
13 | a73b9ab930 |
14 | 55c6aa7ac1 |
15 | 2da79ca701 |
hex | 1a13b9ef39 |
112000102201 has 4 divisors (see below), whose sum is σ = 120615494692. Its totient is φ = 103384709712.
The previous prime is 112000102171. The next prime is 112000102241. The reversal of 112000102201 is 102201000211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 102201000211 = 20183 ⋅5063717.
It can be written as a sum of positive squares in 2 ways, for example, as 53870410000 + 58129692201 = 232100^2 + 241101^2 .
It is a cyclic number.
It is not a de Polignac number, because 112000102201 - 211 = 112000100153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112000102241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4307696226 + ... + 4307696251.
It is an arithmetic number, because the mean of its divisors is an integer number (30153873673).
Almost surely, 2112000102201 is an apocalyptic number.
It is an amenable number.
112000102201 is a deficient number, since it is larger than the sum of its proper divisors (8615392491).
112000102201 is an equidigital number, since it uses as much as digits as its factorization.
112000102201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8615392490.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 112000102201 its reverse (102201000211), we get a palindrome (214201102412).
The spelling of 112000102201 in words is "one hundred twelve billion, one hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •