Base | Representation |
---|---|
bin | 1001011101100010001111… |
… | …1001010000000010010001 |
3 | 1100211111222212021221200012 |
4 | 2113120203321100002101 |
5 | 2330420332312020421 |
6 | 34043024520204305 |
7 | 2122410234340661 |
oct | 227304371200221 |
9 | 40744885257605 |
10 | 10403013001361 |
11 | 33509906a6992 |
12 | 1200210009695 |
13 | 5a5ccca80ab6 |
14 | 27d7195201a1 |
15 | 1309160ec95b |
hex | 97623e50091 |
10403013001361 has 2 divisors, whose sum is σ = 10403013001362. Its totient is φ = 10403013001360.
The previous prime is 10403013001333. The next prime is 10403013001363. The reversal of 10403013001361 is 16310031030401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9719704110736 + 683308890625 = 3117644^2 + 826625^2 .
It is an emirp because it is prime and its reverse (16310031030401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10403013001361 - 222 = 10403008807057 is a prime.
Together with 10403013001363, 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 (10403013001363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5201506500680 + 5201506500681.
It is an arithmetic number, because the mean of its divisors is an integer number (5201506500681).
Almost surely, 210403013001361 is an apocalyptic number.
It is an amenable number.
10403013001361 is a deficient number, since it is larger than the sum of its proper divisors (1).
10403013001361 is an equidigital number, since it uses as much as digits as its factorization.
10403013001361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 10403013001361 its reverse (16310031030401), we get a palindrome (26713044031762).
The spelling of 10403013001361 in words is "ten trillion, four hundred three billion, thirteen million, one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •