Base | Representation |
---|---|
bin | 101111111101101111… |
… | …0000100110011010101 |
3 | 100211212110201101000022 |
4 | 1133323132010303111 |
5 | 3141422310304023 |
6 | 115152524154525 |
7 | 10304341602401 |
oct | 1377336046325 |
9 | 324773641008 |
10 | 103003213013 |
11 | 3a7576a0528 |
12 | 17b67698a45 |
13 | 9936a7a56c |
14 | 4db1c62101 |
15 | 2a2cc157c8 |
hex | 17fb784cd5 |
103003213013 has 2 divisors, whose sum is σ = 103003213014. Its totient is φ = 103003213012.
The previous prime is 103003213007. The next prime is 103003213081. The reversal of 103003213013 is 310312300301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 72868683364 + 30134529649 = 269942^2 + 173593^2 .
It is a cyclic number.
It is not a de Polignac number, because 103003213013 - 210 = 103003211989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103003212982 and 103003213000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103003215013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51501606506 + 51501606507.
It is an arithmetic number, because the mean of its divisors is an integer number (51501606507).
Almost surely, 2103003213013 is an apocalyptic number.
It is an amenable number.
103003213013 is a deficient number, since it is larger than the sum of its proper divisors (1).
103003213013 is an equidigital number, since it uses as much as digits as its factorization.
103003213013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 103003213013 its reverse (310312300301), we get a palindrome (413315513314).
The spelling of 103003213013 in words is "one hundred three billion, three million, two hundred thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •