Base | Representation |
---|---|
bin | 1001001100000101010111… |
… | …0101101010001111110111 |
3 | 1022202212010121021112110001 |
4 | 2103001111311222033313 |
5 | 2311012330010211411 |
6 | 33253203020012131 |
7 | 2061634536223165 |
oct | 223012565521767 |
9 | 38685117245401 |
10 | 10103203210231 |
11 | 32458209053aa |
12 | 117209a391047 |
13 | 58396048ba21 |
14 | 26cdd7772235 |
15 | 127c1a4b1dc1 |
hex | 93055d6a3f7 |
10103203210231 has 2 divisors, whose sum is σ = 10103203210232. Its totient is φ = 10103203210230.
The previous prime is 10103203210229. The next prime is 10103203210237. The reversal of 10103203210231 is 13201230230101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10103203210231 - 21 = 10103203210229 is a prime.
It is a super-2 number, since 2×101032032102312 (a number of 27 digits) contains 22 as substring.
Together with 10103203210229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 10103203210199 and 10103203210208.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10103203210237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051601605115 + 5051601605116.
It is an arithmetic number, because the mean of its divisors is an integer number (5051601605116).
Almost surely, 210103203210231 is an apocalyptic number.
10103203210231 is a deficient number, since it is larger than the sum of its proper divisors (1).
10103203210231 is an equidigital number, since it uses as much as digits as its factorization.
10103203210231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 10103203210231 its reverse (13201230230101), we get a palindrome (23304433440332).
The spelling of 10103203210231 in words is "ten trillion, one hundred three billion, two hundred three million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •