Base | Representation |
---|---|
bin | 1001001100000101101111… |
… | …0010110000101001101111 |
3 | 1022202212101120021010201201 |
4 | 2103001123302300221233 |
5 | 2311013031044111302 |
6 | 33253220545150331 |
7 | 2061640161332644 |
oct | 223013362605157 |
9 | 38685346233651 |
10 | 10103303113327 |
11 | 3245872240046 |
12 | 117210792b3a7 |
13 | 58397809a398 |
14 | 26d006b39dcb |
15 | 127c24147c87 |
hex | 9305bcb0a6f |
10103303113327 has 2 divisors, whose sum is σ = 10103303113328. Its totient is φ = 10103303113326.
The previous prime is 10103303113307. The next prime is 10103303113369. The reversal of 10103303113327 is 72331130330101.
10103303113327 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 is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10103303113327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10103303113295 and 10103303113304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103303113307) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051651556663 + 5051651556664.
It is an arithmetic number, because the mean of its divisors is an integer number (5051651556664).
Almost surely, 210103303113327 is an apocalyptic number.
10103303113327 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103303113327 is an equidigital number, since it uses as much as digits as its factorization.
10103303113327 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3402, while the sum is 28.
Adding to 10103303113327 its reverse (72331130330101), we get a palindrome (82434433443428).
The spelling of 10103303113327 in words is "ten trillion, one hundred three billion, three hundred three million, one hundred thirteen thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •