Base | Representation |
---|---|
bin | 10000010111001101111… |
… | …111100000101010110111 |
3 | 10222111101022211111100001 |
4 | 100113031333200222313 |
5 | 121410324231124143 |
6 | 2220321155532131 |
7 | 144144506026426 |
oct | 20271577405267 |
9 | 3874338744301 |
10 | 1124442442423 |
11 | 3a3967498833 |
12 | 161b115ba047 |
13 | 8205a956361 |
14 | 3c5cd7952bd |
15 | 1e3b173b14d |
hex | 105cdfe0ab7 |
1124442442423 has 2 divisors, whose sum is σ = 1124442442424. Its totient is φ = 1124442442422.
The previous prime is 1124442442421. The next prime is 1124442442441. The reversal of 1124442442423 is 3242442444211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1124442442423 - 21 = 1124442442421 is a prime.
It is a super-2 number, since 2×11244424424232 (a number of 25 digits) contains 22 as substring.
Together with 1124442442421, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1124442442421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 562221221211 + 562221221212.
It is an arithmetic number, because the mean of its divisors is an integer number (562221221212).
Almost surely, 21124442442423 is an apocalyptic number.
1124442442423 is a deficient number, since it is larger than the sum of its proper divisors (1).
1124442442423 is an equidigital number, since it uses as much as digits as its factorization.
1124442442423 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 196608, while the sum is 37.
Adding to 1124442442423 its reverse (3242442444211), we get a palindrome (4366884886634).
The spelling of 1124442442423 in words is "one trillion, one hundred twenty-four billion, four hundred forty-two million, four hundred forty-two thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •