Base | Representation |
---|---|
bin | 10011001100010000… |
… | …00011100001011001 |
3 | 222121001111222221222 |
4 | 21212020003201121 |
5 | 132100122302301 |
6 | 4422215541425 |
7 | 513216536144 |
oct | 114610034131 |
9 | 28531458858 |
10 | 10303322201 |
11 | 4407a58517 |
12 | 1bb668a875 |
13 | c827ac473 |
14 | 6da55d05b |
15 | 40482631b |
hex | 266203859 |
10303322201 has 2 divisors, whose sum is σ = 10303322202. Its totient is φ = 10303322200.
The previous prime is 10303322189. The next prime is 10303322203. The reversal of 10303322201 is 10222330301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10036032400 + 267289801 = 100180^2 + 16349^2 .
It is a cyclic number.
It is not a de Polignac number, because 10303322201 - 210 = 10303321177 is a prime.
Together with 10303322203, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10303322201.
It is not a weakly prime, because it can be changed into another prime (10303322203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151661100 + 5151661101.
It is an arithmetic number, because the mean of its divisors is an integer number (5151661101).
Almost surely, 210303322201 is an apocalyptic number.
It is an amenable number.
10303322201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10303322201 is an equidigital number, since it uses as much as digits as its factorization.
10303322201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 10303322201 its reverse (10222330301), we get a palindrome (20525652502).
The spelling of 10303322201 in words is "ten billion, three hundred three million, three hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •