Base | Representation |
---|---|
bin | 111101010101111… |
… | …1110110111010001 |
3 | 12022110011000102102 |
4 | 1322223332313101 |
5 | 13203414200113 |
6 | 540125330145 |
7 | 102002454335 |
oct | 17253766721 |
9 | 5273130372 |
10 | 2058350033 |
11 | 966980933 |
12 | 495406955 |
13 | 26a5972cc |
14 | 1575277c5 |
15 | c0a8b758 |
hex | 7aafedd1 |
2058350033 has 2 divisors, whose sum is σ = 2058350034. Its totient is φ = 2058350032.
The previous prime is 2058349981. The next prime is 2058350053. The reversal of 2058350033 is 3300538502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1886425489 + 171924544 = 43433^2 + 13112^2 .
It is a cyclic number.
It is not a de Polignac number, because 2058350033 - 224 = 2041572817 is a prime.
It is a super-2 number, since 2×20583500332 = 8473609716702202178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2058349978 and 2058350005.
It is not a weakly prime, because it can be changed into another prime (2058350053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1029175016 + 1029175017.
It is an arithmetic number, because the mean of its divisors is an integer number (1029175017).
Almost surely, 22058350033 is an apocalyptic number.
It is an amenable number.
2058350033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2058350033 is an equidigital number, since it uses as much as digits as its factorization.
2058350033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 29.
The square root of 2058350033 is about 45369.0426722892. The cubic root of 2058350033 is about 1272.0565256531.
Adding to 2058350033 its reverse (3300538502), we get a palindrome (5358888535).
The spelling of 2058350033 in words is "two billion, fifty-eight million, three hundred fifty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •