Base | Representation |
---|---|
bin | 1001110111001001… |
… | …01101100100111101 |
3 | 111122222102202210021 |
4 | 10323210231210331 |
5 | 41320334300114 |
6 | 2233210212141 |
7 | 245126025163 |
oct | 47344554475 |
9 | 14588382707 |
10 | 5294446909 |
11 | 2277639364 |
12 | 1039124051 |
13 | 664b63c2b |
14 | 38322b233 |
15 | 20ec1a024 |
hex | 13b92d93d |
5294446909 has 2 divisors, whose sum is σ = 5294446910. Its totient is φ = 5294446908.
The previous prime is 5294446903. The next prime is 5294446961. The reversal of 5294446909 is 9096444925.
It is a happy number.
It is an a-pointer prime, because the next prime (5294446961) can be obtained adding 5294446909 to its sum of digits (52).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5282091684 + 12355225 = 72678^2 + 3515^2 .
It is a cyclic number.
It is not a de Polignac number, because 5294446909 - 25 = 5294446877 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5294446903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2647223454 + 2647223455.
It is an arithmetic number, because the mean of its divisors is an integer number (2647223455).
Almost surely, 25294446909 is an apocalyptic number.
It is an amenable number.
5294446909 is a deficient number, since it is larger than the sum of its proper divisors (1).
5294446909 is an equidigital number, since it uses as much as digits as its factorization.
5294446909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2799360, while the sum is 52.
The square root of 5294446909 is about 72762.9501119904. The cubic root of 5294446909 is about 1742.9042646641.
The spelling of 5294446909 in words is "five billion, two hundred ninety-four million, four hundred forty-six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •