Base | Representation |
---|---|
bin | 100001101110010… |
… | …0100110000000001 |
3 | 2220212020102001000 |
4 | 1003130210300001 |
5 | 4304140022113 |
6 | 304141202213 |
7 | 40020064335 |
oct | 10334446001 |
9 | 2825212030 |
10 | 1131564033 |
11 | 530813896 |
12 | 276b60369 |
13 | 150582822 |
14 | aa3d77c5 |
15 | 6951d373 |
hex | 43724c01 |
1131564033 has 16 divisors (see below), whose sum is σ = 1691231040. Its totient is φ = 747698112.
The previous prime is 1131564011. The next prime is 1131564059. The reversal of 1131564033 is 3304651311.
1131564033 is a `hidden beast` number, since 1 + 1 + 3 + 15 + 640 + 3 + 3 = 666.
It is not a de Polignac number, because 1131564033 - 220 = 1130515457 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 1131563988 and 1131564006.
It is not an unprimeable number, because it can be changed into a prime (1131560033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 182391 + ... + 188492.
It is an arithmetic number, because the mean of its divisors is an integer number (105701940).
Almost surely, 21131564033 is an apocalyptic number.
It is an amenable number.
1131564033 is a deficient number, since it is larger than the sum of its proper divisors (559667007).
1131564033 is a wasteful number, since it uses less digits than its factorization.
1131564033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371005 (or 370999 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
The square root of 1131564033 is about 33638.7281715584. The cubic root of 1131564033 is about 1042.0607662613.
The spelling of 1131564033 in words is "one billion, one hundred thirty-one million, five hundred sixty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •