Base | Representation |
---|---|
bin | 10000010110001100100… |
… | …011000010000010100001 |
3 | 10222101112210210002201012 |
4 | 100112030203002002201 |
5 | 121401102140123024 |
6 | 2220020214150305 |
7 | 144105344226353 |
oct | 20261443020241 |
9 | 3871483702635 |
10 | 1123344457889 |
11 | 3a345372a7a5 |
12 | 161865952395 |
13 | 81c1432cb74 |
14 | 3c527a1d0d3 |
15 | 1e34a15250e |
hex | 1058c8c20a1 |
1123344457889 has 4 divisors (see below), whose sum is σ = 1127615729856. Its totient is φ = 1119073185924.
The previous prime is 1123344457883. The next prime is 1123344457951. The reversal of 1123344457889 is 9887544433211.
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 1123344457889 - 216 = 1123344392353 is a prime.
It is a Duffinian number.
It is a plaindrome in base 10.
It is not an unprimeable number, because it can be changed into a prime (1123344457883) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2135635589 + ... + 2135636114.
It is an arithmetic number, because the mean of its divisors is an integer number (281903932464).
Almost surely, 21123344457889 is an apocalyptic number.
It is an amenable number.
1123344457889 is a deficient number, since it is larger than the sum of its proper divisors (4271271967).
1123344457889 is an equidigital number, since it uses as much as digits as its factorization.
1123344457889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4271271966.
The product of its digits is 23224320, while the sum is 59.
The spelling of 1123344457889 in words is "one trillion, one hundred twenty-three billion, three hundred forty-four million, four hundred fifty-seven thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •