Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0110110101111010101 |
3 | 100211212221221001000222 |
4 | 1133323320312233111 |
5 | 3141431104431201 |
6 | 115153334444125 |
7 | 10304455351613 |
oct | 1377370665725 |
9 | 324787831028 |
10 | 103010233301 |
11 | 3a760655a18 |
12 | 17b69b03645 |
13 | 9938367a91 |
14 | 4db2b6c6b3 |
15 | 2a2d65091b |
hex | 17fbe36bd5 |
103010233301 has 2 divisors, whose sum is σ = 103010233302. Its totient is φ = 103010233300.
The previous prime is 103010233259. The next prime is 103010233309. The reversal of 103010233301 is 103332010301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103009544401 + 688900 = 320951^2 + 830^2 .
It is a cyclic number.
It is not a de Polignac number, because 103010233301 - 230 = 101936491477 is a prime.
It is a super-2 number, since 2×1030102333012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103010233301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103010233309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505116650 + 51505116651.
It is an arithmetic number, because the mean of its divisors is an integer number (51505116651).
Almost surely, 2103010233301 is an apocalyptic number.
It is an amenable number.
103010233301 is a deficient number, since it is larger than the sum of its proper divisors (1).
103010233301 is an equidigital number, since it uses as much as digits as its factorization.
103010233301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 103010233301 its reverse (103332010301), we get a palindrome (206342243602).
The spelling of 103010233301 in words is "one hundred three billion, ten million, two hundred thirty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •