Base | Representation |
---|---|
bin | 100111101111000… |
… | …111001000111001 |
3 | 1201110102220120012 |
4 | 213233013020321 |
5 | 2331131131213 |
6 | 150052511305 |
7 | 22343346224 |
oct | 4757071071 |
9 | 1643386505 |
10 | 666661433 |
11 | 312349669 |
12 | 16731b535 |
13 | a8168929 |
14 | 6477a5bb |
15 | 3d7d94a8 |
hex | 27bc7239 |
666661433 has 2 divisors, whose sum is σ = 666661434. Its totient is φ = 666661432.
The previous prime is 666661427. The next prime is 666661439. The reversal of 666661433 is 334166666.
It is a balanced prime because it is at equal distance from previous prime (666661427) and next prime (666661439).
It can be written as a sum of positive squares in only one way, i.e., 666310969 + 350464 = 25813^2 + 592^2 .
It is a cyclic number.
It is not a de Polignac number, because 666661433 - 210 = 666660409 is a prime.
It is a super-2 number, since 2×6666614332 = 888874932499226978, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (666661439) 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, 333330716 + 333330717.
It is an arithmetic number, because the mean of its divisors is an integer number (333330717).
Almost surely, 2666661433 is an apocalyptic number.
It is an amenable number.
666661433 is a deficient number, since it is larger than the sum of its proper divisors (1).
666661433 is an equidigital number, since it uses as much as digits as its factorization.
666661433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 279936, while the sum is 41.
The square root of 666661433 is about 25819.7876249980. The cubic root of 666661433 is about 873.5781787158.
The spelling of 666661433 in words is "six hundred sixty-six million, six hundred sixty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •