Base | Representation |
---|---|
bin | 110100001010110010… |
… | …0100000111101100011 |
3 | 101201011122011200011201 |
4 | 1220111210200331203 |
5 | 3313414421342202 |
6 | 123244422022031 |
7 | 11044143104602 |
oct | 1502544407543 |
9 | 351148150151 |
10 | 112031043427 |
11 | 4356a6700a6 |
12 | 19866b77917 |
13 | a745223154 |
14 | 55cac3da39 |
15 | 2daa58d387 |
hex | 1a15920f63 |
112031043427 has 2 divisors, whose sum is σ = 112031043428. Its totient is φ = 112031043426.
The previous prime is 112031043403. The next prime is 112031043431. The reversal of 112031043427 is 724340130211.
It is a strong prime.
It is an emirp because it is prime and its reverse (724340130211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112031043427 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112031043395 and 112031043404.
It is not a weakly prime, because it can be changed into another prime (112031043727) 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, 56015521713 + 56015521714.
It is an arithmetic number, because the mean of its divisors is an integer number (56015521714).
Almost surely, 2112031043427 is an apocalyptic number.
112031043427 is a deficient number, since it is larger than the sum of its proper divisors (1).
112031043427 is an equidigital number, since it uses as much as digits as its factorization.
112031043427 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 28.
Adding to 112031043427 its reverse (724340130211), we get a palindrome (836371173638).
The spelling of 112031043427 in words is "one hundred twelve billion, thirty-one million, forty-three thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •