Base | Representation |
---|---|
bin | 100111111001111… |
… | …010001110000101 |
3 | 1201122202201111202 |
4 | 213321322032011 |
5 | 2332342221401 |
6 | 150233312245 |
7 | 22406406005 |
oct | 4771721605 |
9 | 1648681452 |
10 | 669492101 |
11 | 313a02363 |
12 | 168265685 |
13 | a891a195 |
14 | 64cb6005 |
15 | 3db9806b |
hex | 27e7a385 |
669492101 has 2 divisors, whose sum is σ = 669492102. Its totient is φ = 669492100.
The previous prime is 669492071. The next prime is 669492107. The reversal of 669492101 is 101294966.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 463540900 + 205951201 = 21530^2 + 14351^2 .
It is a cyclic number.
It is not a de Polignac number, because 669492101 - 214 = 669475717 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (669492107) 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, 334746050 + 334746051.
It is an arithmetic number, because the mean of its divisors is an integer number (334746051).
Almost surely, 2669492101 is an apocalyptic number.
It is an amenable number.
669492101 is a deficient number, since it is larger than the sum of its proper divisors (1).
669492101 is an equidigital number, since it uses as much as digits as its factorization.
669492101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23328, while the sum is 38.
The square root of 669492101 is about 25874.5454259587. The cubic root of 669492101 is about 874.8128474833.
The spelling of 669492101 in words is "six hundred sixty-nine million, four hundred ninety-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •