Base | Representation |
---|---|
bin | 10011001110011001… |
… | …10000101011010101 |
3 | 222122022102001001201 |
4 | 21213030300223111 |
5 | 132114230123244 |
6 | 4424101552501 |
7 | 513525611464 |
oct | 114714605325 |
9 | 28568361051 |
10 | 10321332949 |
11 | 441713a234 |
12 | 2000715731 |
13 | c86447305 |
14 | 6dcaca9db |
15 | 4061d2ad4 |
hex | 267330ad5 |
10321332949 has 2 divisors, whose sum is σ = 10321332950. Its totient is φ = 10321332948.
The previous prime is 10321332911. The next prime is 10321333013. The reversal of 10321332949 is 94923312301.
10321332949 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., 8121253924 + 2200079025 = 90118^2 + 46905^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10321332949 is a prime.
It is a super-2 number, since 2×103213329492 (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 (10321332149) 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, 5160666474 + 5160666475.
It is an arithmetic number, because the mean of its divisors is an integer number (5160666475).
Almost surely, 210321332949 is an apocalyptic number.
It is an amenable number.
10321332949 is a deficient number, since it is larger than the sum of its proper divisors (1).
10321332949 is an equidigital number, since it uses as much as digits as its factorization.
10321332949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 37.
The spelling of 10321332949 in words is "ten billion, three hundred twenty-one million, three hundred thirty-two thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •