Base | Representation |
---|---|
bin | 111101011101111010… |
… | …000001010000100001 |
3 | 20022100122122101110200 |
4 | 331131322001100201 |
5 | 2040132000000113 |
6 | 50153041015413 |
7 | 4524353513112 |
oct | 753572012041 |
9 | 208318571420 |
10 | 66000000033 |
11 | 25a99308980 |
12 | 1095b324569 |
13 | 62ba825c76 |
14 | 32a16a2209 |
15 | 1ab438a873 |
hex | f5de81421 |
66000000033 has 12 divisors (see below), whose sum is σ = 104000000208. Its totient is φ = 39999999960.
The previous prime is 66000000013. The next prime is 66000000041. The reversal of 66000000033 is 33000000066.
66000000033 is a `hidden beast` number, since 660 + 0 + 0 + 0 + 0 + 0 + 0 + 3 + 3 = 666.
It is not a de Polignac number, because 66000000033 - 26 = 65999999969 is a prime.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 65999999952 and 66000000015.
It is not an unprimeable number, because it can be changed into a prime (66000000013) 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 in 11 ways as a sum of consecutive naturals, for example, 333333235 + ... + 333333432.
It is an arithmetic number, because the mean of its divisors is an integer number (8666666684).
Almost surely, 266000000033 is an apocalyptic number.
It is an amenable number.
66000000033 is a deficient number, since it is larger than the sum of its proper divisors (38000000175).
66000000033 is a wasteful number, since it uses less digits than its factorization.
66000000033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 666666684 (or 666666681 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 66000000033 its reverse (33000000066), we get a palindrome (99000000099).
The spelling of 66000000033 in words is "sixty-six billion, thirty-three", and thus it is an aban number and an uban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •