Base | Representation |
---|---|
bin | 101111111110100010… |
… | …0101110001011111101 |
3 | 100211221100100110010022 |
4 | 1133331010232023331 |
5 | 3142001202334323 |
6 | 115155325021525 |
7 | 10305116403065 |
oct | 1377504561375 |
9 | 324840313108 |
10 | 103030121213 |
11 | 3a7708aa008 |
12 | 17b746b48a5 |
13 | 993c50c186 |
14 | 4db56683a5 |
15 | 2a3027d4c8 |
hex | 17fd12e2fd |
103030121213 has 2 divisors, whose sum is σ = 103030121214. Its totient is φ = 103030121212.
The previous prime is 103030121189. The next prime is 103030121237. The reversal of 103030121213 is 312121030301.
It is a balanced prime because it is at equal distance from previous prime (103030121189) and next prime (103030121237).
It can be written as a sum of positive squares in only one way, i.e., 102424321444 + 605799769 = 320038^2 + 24613^2 .
It is a cyclic number.
It is not a de Polignac number, because 103030121213 - 28 = 103030120957 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103030121191 and 103030121200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103030120213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51515060606 + 51515060607.
It is an arithmetic number, because the mean of its divisors is an integer number (51515060607).
Almost surely, 2103030121213 is an apocalyptic number.
It is an amenable number.
103030121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
103030121213 is an equidigital number, since it uses as much as digits as its factorization.
103030121213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 103030121213 its reverse (312121030301), we get a palindrome (415151151514).
The spelling of 103030121213 in words is "one hundred three billion, thirty million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •