Base | Representation |
---|---|
bin | 10011011110010001… |
… | …00010110101001101 |
3 | 222222120212212000002 |
4 | 21233020202311031 |
5 | 132402314223024 |
6 | 4445215014045 |
7 | 520033214423 |
oct | 115710426515 |
9 | 28876785002 |
10 | 10454445389 |
11 | 4485297613 |
12 | 203920a325 |
13 | ca7bb267b |
14 | 71265b113 |
15 | 412c286ae |
hex | 26f222d4d |
10454445389 has 2 divisors, whose sum is σ = 10454445390. Its totient is φ = 10454445388.
The previous prime is 10454445367. The next prime is 10454445403. The reversal of 10454445389 is 98354445401.
10454445389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8157160489 + 2297284900 = 90317^2 + 47930^2 .
It is a cyclic number.
It is not a de Polignac number, because 10454445389 - 220 = 10453396813 is a prime.
It is a super-2 number, since 2×104544453892 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10453445389) 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, 5227222694 + 5227222695.
It is an arithmetic number, because the mean of its divisors is an integer number (5227222695).
Almost surely, 210454445389 is an apocalyptic number.
It is an amenable number.
10454445389 is a deficient number, since it is larger than the sum of its proper divisors (1).
10454445389 is an equidigital number, since it uses as much as digits as its factorization.
10454445389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1382400, while the sum is 47.
The spelling of 10454445389 in words is "ten billion, four hundred fifty-four million, four hundred forty-five thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •