Base | Representation |
---|---|
bin | 111011111011110… |
… | …000010100000101 |
3 | 2121002001201022102 |
4 | 323323300110011 |
5 | 4024403121013 |
6 | 243435441445 |
7 | 33626531402 |
oct | 7373602405 |
9 | 2532051272 |
10 | 1005520133 |
11 | 476654182 |
12 | 2408b6285 |
13 | 130420937 |
14 | 977872a9 |
15 | 5d421d58 |
hex | 3bef0505 |
1005520133 has 2 divisors, whose sum is σ = 1005520134. Its totient is φ = 1005520132.
The previous prime is 1005520129. The next prime is 1005520163. The reversal of 1005520133 is 3310255001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 523585924 + 481934209 = 22882^2 + 21953^2 .
It is an emirp because it is prime and its reverse (3310255001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1005520133 - 22 = 1005520129 is a prime.
It is a super-2 number, since 2×10055201332 = 2022141475736675378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1005520163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 502760066 + 502760067.
It is an arithmetic number, because the mean of its divisors is an integer number (502760067).
Almost surely, 21005520133 is an apocalyptic number.
It is an amenable number.
1005520133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1005520133 is an equidigital number, since it uses as much as digits as its factorization.
1005520133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 450, while the sum is 20.
The square root of 1005520133 is about 31709.9374486926. The cubic root of 1005520133 is about 1001.8366689154.
Adding to 1005520133 its reverse (3310255001), we get a palindrome (4315775134).
The spelling of 1005520133 in words is "one billion, five million, five hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •