Base | Representation |
---|---|
bin | 100010000011110… |
… | …1001100101100001 |
3 | 2221122111002202020 |
4 | 1010013221211201 |
5 | 4320032343113 |
6 | 305223212053 |
7 | 40215054534 |
oct | 10407514541 |
9 | 2848432666 |
10 | 1142856033 |
11 | 537126720 |
12 | 27a8a7029 |
13 | 152a07497 |
14 | abad6a1b |
15 | 6a4ee023 |
hex | 441e9961 |
1142856033 has 16 divisors (see below), whose sum is σ = 1673352192. Its totient is φ = 688050000.
The previous prime is 1142855977. The next prime is 1142856047. The reversal of 1142856033 is 3306582411.
It is not a de Polignac number, because 1142856033 - 29 = 1142855521 is a prime.
It is a super-2 number, since 2×11428560332 = 2612239824328994178, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 1142855985 and 1142856003.
It is not an unprimeable number, because it can be changed into a prime (1142856053) 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 15 ways as a sum of consecutive naturals, for example, 109693 + ... + 119658.
It is an arithmetic number, because the mean of its divisors is an integer number (104584512).
Almost surely, 21142856033 is an apocalyptic number.
It is an amenable number.
1142856033 is a deficient number, since it is larger than the sum of its proper divisors (530496159).
1142856033 is a wasteful number, since it uses less digits than its factorization.
1142856033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 229516.
The product of its (nonzero) digits is 17280, while the sum is 33.
The square root of 1142856033 is about 33806.1537741282. The cubic root of 1142856033 is about 1045.5155787071.
The spelling of 1142856033 in words is "one billion, one hundred forty-two million, eight hundred fifty-six thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •