Base | Representation |
---|---|
bin | 1100001111011… |
… | …11001001111011 |
3 | 21011020021012002 |
4 | 12013233021323 |
5 | 202242111301 |
6 | 14105011215 |
7 | 2354601662 |
oct | 607571173 |
9 | 234207162 |
10 | 102691451 |
11 | 52a6a675 |
12 | 2a483b0b |
13 | 18376895 |
14 | d8d1dd9 |
15 | 903716b |
hex | 61ef27b |
102691451 has 2 divisors, whose sum is σ = 102691452. Its totient is φ = 102691450.
The previous prime is 102691427. The next prime is 102691469. The reversal of 102691451 is 154196201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 102691451 - 218 = 102429307 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (102691411) 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, 51345725 + 51345726.
It is an arithmetic number, because the mean of its divisors is an integer number (51345726).
Almost surely, 2102691451 is an apocalyptic number.
102691451 is a deficient number, since it is larger than the sum of its proper divisors (1).
102691451 is an equidigital number, since it uses as much as digits as its factorization.
102691451 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
The square root of 102691451 is about 10133.6790456379. The cubic root of 102691451 is about 468.2862759534.
The spelling of 102691451 in words is "one hundred two million, six hundred ninety-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •