Base | Representation |
---|---|
bin | 101111111110100010… |
… | …0110001001001010101 |
3 | 100211221100101001202012 |
4 | 1133331010301021111 |
5 | 3142001203231313 |
6 | 115155325154005 |
7 | 10305116453321 |
oct | 1377504611125 |
9 | 324840331665 |
10 | 103030133333 |
11 | 3a770908126 |
12 | 17b746bb905 |
13 | 993c51484a |
14 | 4db566c981 |
15 | 2a30281da8 |
hex | 17fd131255 |
103030133333 has 2 divisors, whose sum is σ = 103030133334. Its totient is φ = 103030133332.
The previous prime is 103030133263. The next prime is 103030133347. The reversal of 103030133333 is 333331030301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 78726258724 + 24303874609 = 280582^2 + 155897^2 .
It is an emirp because it is prime and its reverse (333331030301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103030133333 - 214 = 103030116949 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103030133299 and 103030133308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103830133333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515066666 + 51515066667.
It is an arithmetic number, because the mean of its divisors is an integer number (51515066667).
Almost surely, 2103030133333 is an apocalyptic number.
It is an amenable number.
103030133333 is a deficient number, since it is larger than the sum of its proper divisors (1).
103030133333 is an equidigital number, since it uses as much as digits as its factorization.
103030133333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2187, while the sum is 23.
Adding to 103030133333 its reverse (333331030301), we get a palindrome (436361163634).
The spelling of 103030133333 in words is "one hundred three billion, thirty million, one hundred thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •