Base | Representation |
---|---|
bin | 10011001110101001… |
… | …01100100110001101 |
3 | 222122110022201220001 |
4 | 21213110230212031 |
5 | 132120243212024 |
6 | 4424214324301 |
7 | 513552365062 |
oct | 114724544615 |
9 | 28573281801 |
10 | 10323413389 |
11 | 4418330303 |
12 | 2001359691 |
13 | c869c5243 |
14 | 6dd0acc69 |
15 | 406494244 |
hex | 26752c98d |
10323413389 has 2 divisors, whose sum is σ = 10323413390. Its totient is φ = 10323413388.
The previous prime is 10323413377. The next prime is 10323413453. The reversal of 10323413389 is 98331432301.
It is a happy number.
10323413389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6267888900 + 4055524489 = 79170^2 + 63683^2 .
It is an emirp because it is prime and its reverse (98331432301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10323413389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10323413339) 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, 5161706694 + 5161706695.
It is an arithmetic number, because the mean of its divisors is an integer number (5161706695).
Almost surely, 210323413389 is an apocalyptic number.
It is an amenable number.
10323413389 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323413389 is an equidigital number, since it uses as much as digits as its factorization.
10323413389 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 37.
The spelling of 10323413389 in words is "ten billion, three hundred twenty-three million, four hundred thirteen thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •