Base | Representation |
---|---|
bin | 110000001010011101… |
… | …1101101101011010101 |
3 | 100212222020120101020112 |
4 | 1200110323231223111 |
5 | 3143311141204023 |
6 | 115303144412405 |
7 | 10321050001424 |
oct | 1402473555325 |
9 | 325866511215 |
10 | 103430413013 |
11 | 3a956854184 |
12 | 18066777105 |
13 | 99a4423525 |
14 | 50128a72bb |
15 | 2a5549d478 |
hex | 1814eedad5 |
103430413013 has 2 divisors, whose sum is σ = 103430413014. Its totient is φ = 103430413012.
The previous prime is 103430412991. The next prime is 103430413019. The reversal of 103430413013 is 310314034301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97305315844 + 6125097169 = 311938^2 + 78263^2 .
It is an emirp because it is prime and its reverse (310314034301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103430413013 - 224 = 103413635797 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103430413013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103430413019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51715206506 + 51715206507.
It is an arithmetic number, because the mean of its divisors is an integer number (51715206507).
Almost surely, 2103430413013 is an apocalyptic number.
It is an amenable number.
103430413013 is a deficient number, since it is larger than the sum of its proper divisors (1).
103430413013 is an equidigital number, since it uses as much as digits as its factorization.
103430413013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 103430413013 its reverse (310314034301), we get a palindrome (413744447314).
The spelling of 103430413013 in words is "one hundred three billion, four hundred thirty million, four hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •