Base | Representation |
---|---|
bin | 1010001111011111… |
… | …11110000111010101 |
3 | 112012012211011101212 |
4 | 11013233332013111 |
5 | 42230133143241 |
6 | 2305344431205 |
7 | 253156250462 |
oct | 50757760725 |
9 | 15165734355 |
10 | 5498724821 |
11 | 2371983387 |
12 | 1095618505 |
13 | 698288435 |
14 | 3a2404669 |
15 | 222b1bbeb |
hex | 147bfe1d5 |
5498724821 has 2 divisors, whose sum is σ = 5498724822. Its totient is φ = 5498724820.
The previous prime is 5498724797. The next prime is 5498724823. The reversal of 5498724821 is 1284278945.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4397148721 + 1101576100 = 66311^2 + 33190^2 .
It is a cyclic number.
It is not a de Polignac number, because 5498724821 - 214 = 5498708437 is a prime.
It is a Sophie Germain prime.
Together with 5498724823, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5498724821.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5498724823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2749362410 + 2749362411.
It is an arithmetic number, because the mean of its divisors is an integer number (2749362411).
Almost surely, 25498724821 is an apocalyptic number.
It is an amenable number.
5498724821 is a deficient number, since it is larger than the sum of its proper divisors (1).
5498724821 is an equidigital number, since it uses as much as digits as its factorization.
5498724821 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1290240, while the sum is 50.
The square root of 5498724821 is about 74153.3871175147. The cubic root of 5498724821 is about 1765.0377381472.
The spelling of 5498724821 in words is "five billion, four hundred ninety-eight million, seven hundred twenty-four thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •