Base | Representation |
---|---|
bin | 1011111010100… |
… | …01010011110001 |
3 | 20222001212112221 |
4 | 11331101103301 |
5 | 201041312021 |
6 | 13530121041 |
7 | 2322353614 |
oct | 575212361 |
9 | 228055487 |
10 | 99947761 |
11 | 51466261 |
12 | 29580181 |
13 | 17925ab4 |
14 | d3ba17b |
15 | 8b94241 |
hex | 5f514f1 |
99947761 has 4 divisors (see below), whose sum is σ = 100362724. Its totient is φ = 99532800.
The previous prime is 99947747. The next prime is 99947789. The reversal of 99947761 is 16774999.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16774999 = 31 ⋅541129.
It can be written as a sum of positive squares in 2 ways, for example, as 85840225 + 14107536 = 9265^2 + 3756^2 .
It is a 5-Lehmer number, since φ(99947761) divides (99947761-1)5.
It is a cyclic number.
It is not a de Polignac number, because 99947761 - 215 = 99914993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 99947699 and 99947708.
It is not an unprimeable number, because it can be changed into a prime (99947741) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 207120 + ... + 207601.
It is an arithmetic number, because the mean of its divisors is an integer number (25090681).
Almost surely, 299947761 is an apocalyptic number.
It is an amenable number.
99947761 is a deficient number, since it is larger than the sum of its proper divisors (414963).
99947761 is a wasteful number, since it uses less digits than its factorization.
99947761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 414962.
The product of its digits is 857304, while the sum is 52.
The square root of 99947761 is about 9997.3877087967. The cubic root of 99947761 is about 464.0780452970.
The spelling of 99947761 in words is "ninety-nine million, nine hundred forty-seven thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •