Base | Representation |
---|---|
bin | 110100001010100001… |
… | …0000101111110100001 |
3 | 101201011000012020100202 |
4 | 1220111002011332201 |
5 | 3313410114120001 |
6 | 123243500354545 |
7 | 11044003313333 |
oct | 1502502057641 |
9 | 351130166322 |
10 | 112022020001 |
11 | 43565567721 |
12 | 19863b45a55 |
13 | a7433b3c48 |
14 | 55c9971453 |
15 | 2da98a996b |
hex | 1a15085fa1 |
112022020001 has 4 divisors (see below), whose sum is σ = 112025492100. Its totient is φ = 112018547904.
The previous prime is 112022019983. The next prime is 112022020003. The reversal of 112022020001 is 100020220211.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100020220211 = 89 ⋅1123822699.
It can be written as a sum of positive squares in 2 ways, for example, as 82972226401 + 29049793600 = 288049^2 + 170440^2 .
It is a cyclic number.
It is not a de Polignac number, because 112022020001 - 218 = 112021757857 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112022020003) 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, 1687196 + ... + 1752333.
It is an arithmetic number, because the mean of its divisors is an integer number (28006373025).
Almost surely, 2112022020001 is an apocalyptic number.
It is an amenable number.
112022020001 is a deficient number, since it is larger than the sum of its proper divisors (3472099).
112022020001 is an equidigital number, since it uses as much as digits as its factorization.
112022020001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3472098.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 112022020001 its reverse (100020220211), we get a palindrome (212042240212).
The spelling of 112022020001 in words is "one hundred twelve billion, twenty-two million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •