Base | Representation |
---|---|
bin | 10000001101101100111… |
… | …100000110011110000011 |
3 | 10221112000012110012222201 |
4 | 100031230330012132003 |
5 | 121223412400133011 |
6 | 2211511220014031 |
7 | 143333341431514 |
oct | 20155474063603 |
9 | 3845005405881 |
10 | 1114224224131 |
11 | 39a5a3588127 |
12 | 15bb3b531317 |
13 | 810bc9a3445 |
14 | 3bd0066aa0b |
15 | 1deb4625cc1 |
hex | 1036cf06783 |
1114224224131 has 2 divisors, whose sum is σ = 1114224224132. Its totient is φ = 1114224224130.
The previous prime is 1114224224083. The next prime is 1114224224147. The reversal of 1114224224131 is 1314224224111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1114224224131 - 215 = 1114224191363 is a prime.
It is a super-2 number, since 2×11142242241312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1114224224131.
It is not a weakly prime, because it can be changed into another prime (1114224224831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 557112112065 + 557112112066.
It is an arithmetic number, because the mean of its divisors is an integer number (557112112066).
Almost surely, 21114224224131 is an apocalyptic number.
1114224224131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1114224224131 is an equidigital number, since it uses as much as digits as its factorization.
1114224224131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3072, while the sum is 28.
Adding to 1114224224131 its reverse (1314224224111), we get a palindrome (2428448448242).
The spelling of 1114224224131 in words is "one trillion, one hundred fourteen billion, two hundred twenty-four million, two hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.083 sec. • engine limits •