Base | Representation |
---|---|
bin | 1011110101011… |
… | …01001111100101 |
3 | 20220210201201121 |
4 | 11322231033211 |
5 | 200403310444 |
6 | 13503453541 |
7 | 2313554446 |
oct | 572551745 |
9 | 226721647 |
10 | 99275749 |
11 | 51047381 |
12 | 292b72b1 |
13 | 1774bc61 |
14 | d2832cd |
15 | 8ab0084 |
hex | 5ead3e5 |
99275749 has 2 divisors, whose sum is σ = 99275750. Its totient is φ = 99275748.
The previous prime is 99275747. The next prime is 99275789. The reversal of 99275749 is 94757299.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 70728100 + 28547649 = 8410^2 + 5343^2 .
It is a cyclic number.
It is not a de Polignac number, because 99275749 - 21 = 99275747 is a prime.
It is a super-2 number, since 2×992757492 = 19711348679022002, which contains 22 as substring.
Together with 99275747, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 99275696 and 99275705.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (99275747) 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, 49637874 + 49637875.
It is an arithmetic number, because the mean of its divisors is an integer number (49637875).
Almost surely, 299275749 is an apocalyptic number.
It is an amenable number.
99275749 is a deficient number, since it is larger than the sum of its proper divisors (1).
99275749 is an equidigital number, since it uses as much as digits as its factorization.
99275749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1428840, while the sum is 52.
The square root of 99275749 is about 9963.7216440445. The cubic root of 99275749 is about 463.0356087536.
The spelling of 99275749 in words is "ninety-nine million, two hundred seventy-five thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •