Base | Representation |
---|---|
bin | 10011001100001101… |
… | …10111110010100001 |
3 | 222121000221020110002 |
4 | 21212012313302201 |
5 | 132100032341001 |
6 | 4422205145345 |
7 | 513214104602 |
oct | 114606676241 |
9 | 28530836402 |
10 | 10303012001 |
11 | 4407866457 |
12 | 1bb655b255 |
13 | c82701209 |
14 | 6da4bbda9 |
15 | 4047b446b |
hex | 2661b7ca1 |
10303012001 has 2 divisors, whose sum is σ = 10303012002. Its totient is φ = 10303012000.
The previous prime is 10303011997. The next prime is 10303012003. The reversal of 10303012001 is 10021030301.
10303012001 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., 9448034401 + 854977600 = 97201^2 + 29240^2 .
It is a cyclic number.
It is not a de Polignac number, because 10303012001 - 22 = 10303011997 is a prime.
Together with 10303012003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10303012003) 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, 5151506000 + 5151506001.
It is an arithmetic number, because the mean of its divisors is an integer number (5151506001).
Almost surely, 210303012001 is an apocalyptic number.
It is an amenable number.
10303012001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10303012001 is an equidigital number, since it uses as much as digits as its factorization.
10303012001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 11.
Adding to 10303012001 its reverse (10021030301), we get a palindrome (20324042302).
The spelling of 10303012001 in words is "ten billion, three hundred three million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •