Base | Representation |
---|---|
bin | 10011001110101010… |
… | …01001011100010101 |
3 | 222122110112201222001 |
4 | 21213111021130111 |
5 | 132120311002131 |
6 | 4424221035301 |
7 | 513553366411 |
oct | 114725113425 |
9 | 28573481861 |
10 | 10323531541 |
11 | 4418401054 |
12 | 20013b5b31 |
13 | c86a36c5b |
14 | 6dd0ddd41 |
15 | 4064b9261 |
hex | 267549715 |
10323531541 has 2 divisors, whose sum is σ = 10323531542. Its totient is φ = 10323531540.
The previous prime is 10323531539. The next prime is 10323531551. The reversal of 10323531541 is 14513532301.
It is a happy number.
10323531541 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., 5214284100 + 5109247441 = 72210^2 + 71479^2 .
It is a cyclic number.
It is not a de Polignac number, because 10323531541 - 21 = 10323531539 is a prime.
Together with 10323531539, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10323531511) 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, 5161765770 + 5161765771.
It is an arithmetic number, because the mean of its divisors is an integer number (5161765771).
Almost surely, 210323531541 is an apocalyptic number.
It is an amenable number.
10323531541 is a deficient number, since it is larger than the sum of its proper divisors (1).
10323531541 is an equidigital number, since it uses as much as digits as its factorization.
10323531541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 28.
The spelling of 10323531541 in words is "ten billion, three hundred twenty-three million, five hundred thirty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •