Base | Representation |
---|---|
bin | 100001110001000… |
… | …1011011000001101 |
3 | 2220222000001001012 |
4 | 1003202023120031 |
5 | 4310024023343 |
6 | 304232455005 |
7 | 40035423062 |
oct | 10342133015 |
9 | 2828001035 |
10 | 1133032973 |
11 | 531627496 |
12 | 27754a465 |
13 | 150978317 |
14 | aa69ac69 |
15 | 6970d718 |
hex | 4388b60d |
1133032973 has 2 divisors, whose sum is σ = 1133032974. Its totient is φ = 1133032972.
The previous prime is 1133032963. The next prime is 1133032997. The reversal of 1133032973 is 3792303311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 721835689 + 411197284 = 26867^2 + 20278^2 .
It is an emirp because it is prime and its reverse (3792303311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1133032973 - 28 = 1133032717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1133032963) 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 as a sum of consecutive naturals, namely, 566516486 + 566516487.
It is an arithmetic number, because the mean of its divisors is an integer number (566516487).
Almost surely, 21133032973 is an apocalyptic number.
It is an amenable number.
1133032973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1133032973 is an equidigital number, since it uses as much as digits as its factorization.
1133032973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10206, while the sum is 32.
The square root of 1133032973 is about 33660.5551499080. Note that the first 3 decimals coincide. The cubic root of 1133032973 is about 1042.5114883900.
The spelling of 1133032973 in words is "one billion, one hundred thirty-three million, thirty-two thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.156 sec. • engine limits •