Base | Representation |
---|---|
bin | 10011011100110010… |
… | …11111100010010011 |
3 | 222221201200012120102 |
4 | 21232121133202103 |
5 | 132341140023443 |
6 | 4444054403015 |
7 | 516523323443 |
oct | 115631374223 |
9 | 28851605512 |
10 | 10442111123 |
11 | 4479332704 |
12 | 203506046b |
13 | ca54844a2 |
14 | 710b6a123 |
15 | 411addcb8 |
hex | 26e65f893 |
10442111123 has 2 divisors, whose sum is σ = 10442111124. Its totient is φ = 10442111122.
The previous prime is 10442111111. The next prime is 10442111129. The reversal of 10442111123 is 32111124401.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10442111123 is a prime.
It is a super-2 number, since 2×104421111232 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10442111095 and 10442111104.
It is not a weakly prime, because it can be changed into another prime (10442111129) 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, 5221055561 + 5221055562.
It is an arithmetic number, because the mean of its divisors is an integer number (5221055562).
Almost surely, 210442111123 is an apocalyptic number.
10442111123 is a deficient number, since it is larger than the sum of its proper divisors (1).
10442111123 is an equidigital number, since it uses as much as digits as its factorization.
10442111123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10442111123 its reverse (32111124401), we get a palindrome (42553235524).
The spelling of 10442111123 in words is "ten billion, four hundred forty-two million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •