Base | Representation |
---|---|
bin | 100001100100111… |
… | …1001111100111111 |
3 | 2220112000202212211 |
4 | 1003021321330333 |
5 | 4301411421033 |
6 | 303444241251 |
7 | 36630352414 |
oct | 10311717477 |
9 | 2815022784 |
10 | 1126670143 |
11 | 528a80a55 |
12 | 2753a0227 |
13 | 14c55b131 |
14 | a98c210b |
15 | 68da32cd |
hex | 43279f3f |
1126670143 has 2 divisors, whose sum is σ = 1126670144. Its totient is φ = 1126670142.
The previous prime is 1126670123. The next prime is 1126670147. The reversal of 1126670143 is 3410766211.
It is a strong prime.
It is an emirp because it is prime and its reverse (3410766211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1126670143 is a prime.
It is a super-2 number, since 2×11266701432 = 2538771222255280898, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1126670147) 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, 563335071 + 563335072.
It is an arithmetic number, because the mean of its divisors is an integer number (563335072).
Almost surely, 21126670143 is an apocalyptic number.
1126670143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1126670143 is an equidigital number, since it uses as much as digits as its factorization.
1126670143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 31.
The square root of 1126670143 is about 33565.9074508645. The cubic root of 1126670143 is about 1040.5563292594.
The spelling of 1126670143 in words is "one billion, one hundred twenty-six million, six hundred seventy thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •