Base | Representation |
---|---|
bin | 111100000000101… |
… | …0110111101110101 |
3 | 12012022222121021112 |
4 | 1320001112331311 |
5 | 13110441402013 |
6 | 531450524405 |
7 | 100620335315 |
oct | 17001267565 |
9 | 5168877245 |
10 | 2013622133 |
11 | 943701126 |
12 | 482436705 |
13 | 2612367b3 |
14 | 151603445 |
15 | bbba3ba8 |
hex | 78056f75 |
2013622133 has 2 divisors, whose sum is σ = 2013622134. Its totient is φ = 2013622132.
The previous prime is 2013622129. The next prime is 2013622157. The reversal of 2013622133 is 3312263102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1420309969 + 593312164 = 37687^2 + 24358^2 .
It is a cyclic number.
It is not a de Polignac number, because 2013622133 - 22 = 2013622129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2013622099 and 2013622108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2013622123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006811066 + 1006811067.
It is an arithmetic number, because the mean of its divisors is an integer number (1006811067).
Almost surely, 22013622133 is an apocalyptic number.
It is an amenable number.
2013622133 is a deficient number, since it is larger than the sum of its proper divisors (1).
2013622133 is an equidigital number, since it uses as much as digits as its factorization.
2013622133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
The square root of 2013622133 is about 44873.4011748608. The cubic root of 2013622133 is about 1262.7750487621.
Adding to 2013622133 its reverse (3312263102), we get a palindrome (5325885235).
The spelling of 2013622133 in words is "two billion, thirteen million, six hundred twenty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •