Base | Representation |
---|---|
bin | 11111100011011001… |
… | …111100011000111101 |
3 | 10020110011012022212002 |
4 | 133203121330120331 |
5 | 1023341240000221 |
6 | 23321513552045 |
7 | 2306402151245 |
oct | 374331743075 |
9 | 106404168762 |
10 | 33880000061 |
11 | 13406416556 |
12 | 6696415625 |
13 | 326c18c91b |
14 | 18d5882b25 |
15 | d3459880b |
hex | 7e367c63d |
33880000061 has 2 divisors, whose sum is σ = 33880000062. Its totient is φ = 33880000060.
The previous prime is 33880000019. The next prime is 33880000067. The reversal of 33880000061 is 16000008833.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 33288002500 + 591997561 = 182450^2 + 24331^2 .
It is a cyclic number.
It is not a de Polignac number, because 33880000061 - 214 = 33879983677 is a prime.
It is a super-2 number, since 2×338800000612 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 33879999979 and 33880000033.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (33880000067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16940000030 + 16940000031.
It is an arithmetic number, because the mean of its divisors is an integer number (16940000031).
Almost surely, 233880000061 is an apocalyptic number.
It is an amenable number.
33880000061 is a deficient number, since it is larger than the sum of its proper divisors (1).
33880000061 is an equidigital number, since it uses as much as digits as its factorization.
33880000061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 33880000061 its reverse (16000008833), we get a palindrome (49880008894).
The spelling of 33880000061 in words is "thirty-three billion, eight hundred eighty million, sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •