Base | Representation |
---|---|
bin | 1010001011101000… |
… | …00011001111101101 |
3 | 112002221200202120122 |
4 | 11011310003033231 |
5 | 42143324134411 |
6 | 2302224254325 |
7 | 252313162466 |
oct | 50564031755 |
9 | 15087622518 |
10 | 5466239981 |
11 | 2355606004 |
12 | 10867713a5 |
13 | 691623437 |
14 | 39bd89d6d |
15 | 21ed519db |
hex | 145d033ed |
5466239981 has 2 divisors, whose sum is σ = 5466239982. Its totient is φ = 5466239980.
The previous prime is 5466239953. The next prime is 5466240011. The reversal of 5466239981 is 1899326645.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5447178025 + 19061956 = 73805^2 + 4366^2 .
It is a cyclic number.
It is not a de Polignac number, because 5466239981 - 210 = 5466238957 is a prime.
It is a super-2 number, since 2×54662399812 = 59759559059765760722, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5466239081) 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, 2733119990 + 2733119991.
It is an arithmetic number, because the mean of its divisors is an integer number (2733119991).
Almost surely, 25466239981 is an apocalyptic number.
It is an amenable number.
5466239981 is a deficient number, since it is larger than the sum of its proper divisors (1).
5466239981 is an equidigital number, since it uses as much as digits as its factorization.
5466239981 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2799360, while the sum is 53.
The square root of 5466239981 is about 73934.0245151040. The cubic root of 5466239981 is about 1761.5550973301. Note that the first 3 decimals are identical.
The spelling of 5466239981 in words is "five billion, four hundred sixty-six million, two hundred thirty-nine thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •