Base | Representation |
---|---|
bin | 110100010011000110… |
… | …1000010011001110101 |
3 | 101201220002021022001101 |
4 | 1220212031002121311 |
5 | 3320002341222441 |
6 | 123332231130101 |
7 | 11054102053414 |
oct | 1504615023165 |
9 | 351802238041 |
10 | 112310101621 |
11 | 436a3140703 |
12 | 19924513931 |
13 | a78ac9ac43 |
14 | 5615d2147b |
15 | 2dc4d12231 |
hex | 1a26342675 |
112310101621 has 2 divisors, whose sum is σ = 112310101622. Its totient is φ = 112310101620.
The previous prime is 112310101583. The next prime is 112310101649. The reversal of 112310101621 is 126101013211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96572399121 + 15737702500 = 310761^2 + 125450^2 .
It is a cyclic number.
It is not a de Polignac number, because 112310101621 - 29 = 112310101109 is a prime.
It is a super-2 number, since 2×1123101016212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112310101721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56155050810 + 56155050811.
It is an arithmetic number, because the mean of its divisors is an integer number (56155050811).
Almost surely, 2112310101621 is an apocalyptic number.
It is an amenable number.
112310101621 is a deficient number, since it is larger than the sum of its proper divisors (1).
112310101621 is an equidigital number, since it uses as much as digits as its factorization.
112310101621 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 112310101621 its reverse (126101013211), we get a palindrome (238411114832).
The spelling of 112310101621 in words is "one hundred twelve billion, three hundred ten million, one hundred one thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •