Base | Representation |
---|---|
bin | 10000001101101000000… |
… | …110110000010111101001 |
3 | 10221111210112212021021121 |
4 | 100031220012300113221 |
5 | 121223231120143423 |
6 | 2211455201535241 |
7 | 143331335233645 |
oct | 20155006602751 |
9 | 3844715767247 |
10 | 1114143131113 |
11 | 39a56182a801 |
12 | 15bb18344521 |
13 | 810a8c4c6cc |
14 | 3bcd399bc25 |
15 | 1deac45845d |
hex | 103681b05e9 |
1114143131113 has 4 divisors (see below), whose sum is σ = 1114145847808. Its totient is φ = 1114140414420.
The previous prime is 1114143131081. The next prime is 1114143131183. The reversal of 1114143131113 is 3111313414111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1114143131113 - 25 = 1114143131081 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1114143131183) 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 in 3 ways as a sum of consecutive naturals, for example, 603273 + ... + 1610038.
It is an arithmetic number, because the mean of its divisors is an integer number (278536461952).
Almost surely, 21114143131113 is an apocalyptic number.
It is an amenable number.
1114143131113 is a deficient number, since it is larger than the sum of its proper divisors (2716695).
1114143131113 is an equidigital number, since it uses as much as digits as its factorization.
1114143131113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2716694.
The product of its digits is 432, while the sum is 25.
Adding to 1114143131113 its reverse (3111313414111), we get a palindrome (4225456545224).
The spelling of 1114143131113 in words is "one trillion, one hundred fourteen billion, one hundred forty-three million, one hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •