Base | Representation |
---|---|
bin | 110100001010111000… |
… | …0101001011110010101 |
3 | 101201011212011021010111 |
4 | 1220111300221132111 |
5 | 3313421230132041 |
6 | 123245014123021 |
7 | 11044212122506 |
oct | 1502560513625 |
9 | 351155137114 |
10 | 112034224021 |
11 | 43571442795 |
12 | 19868050471 |
13 | a745a97a65 |
14 | 55cb42abad |
15 | 2daa9ba981 |
hex | 1a15c29795 |
112034224021 has 2 divisors, whose sum is σ = 112034224022. Its totient is φ = 112034224020.
The previous prime is 112034224013. The next prime is 112034224051. The reversal of 112034224021 is 120422430211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107034319921 + 4999904100 = 327161^2 + 70710^2 .
It is a cyclic number.
It is not a de Polignac number, because 112034224021 - 23 = 112034224013 is a prime.
It is a super-2 number, since 2×1120342240212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112034223983 and 112034224001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112034224051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56017112010 + 56017112011.
It is an arithmetic number, because the mean of its divisors is an integer number (56017112011).
Almost surely, 2112034224021 is an apocalyptic number.
It is an amenable number.
112034224021 is a deficient number, since it is larger than the sum of its proper divisors (1).
112034224021 is an equidigital number, since it uses as much as digits as its factorization.
112034224021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 768, while the sum is 22.
Adding to 112034224021 its reverse (120422430211), we get a palindrome (232456654232).
The spelling of 112034224021 in words is "one hundred twelve billion, thirty-four million, two hundred twenty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.380 sec. • engine limits •