Base | Representation |
---|---|
bin | 10011001110111001… |
… | …10100100101000101 |
3 | 222122121022221111022 |
4 | 21213130310211011 |
5 | 132121314340422 |
6 | 4424332120525 |
7 | 513606445412 |
oct | 114734644505 |
9 | 28577287438 |
10 | 10325543237 |
11 | 4419555509 |
12 | 2002006145 |
13 | c8728c7c9 |
14 | 6dd4a5109 |
15 | 406765342 |
hex | 267734945 |
10325543237 has 2 divisors, whose sum is σ = 10325543238. Its totient is φ = 10325543236.
The previous prime is 10325543159. The next prime is 10325543303. The reversal of 10325543237 is 73234552301.
10325543237 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., 7952002276 + 2373540961 = 89174^2 + 48719^2 .
It is a cyclic number.
It is not a de Polignac number, because 10325543237 - 212 = 10325539141 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10325543197 and 10325543206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10325540237) 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, 5162771618 + 5162771619.
It is an arithmetic number, because the mean of its divisors is an integer number (5162771619).
Almost surely, 210325543237 is an apocalyptic number.
It is an amenable number.
10325543237 is a deficient number, since it is larger than the sum of its proper divisors (1).
10325543237 is an equidigital number, since it uses as much as digits as its factorization.
10325543237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75600, while the sum is 35.
The spelling of 10325543237 in words is "ten billion, three hundred twenty-five million, five hundred forty-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •