Base | Representation |
---|---|
bin | 101111011111110101… |
… | …1001000011111000101 |
3 | 100202021120000000121101 |
4 | 1132333223020133011 |
5 | 3132344000044023 |
6 | 114505210020101 |
7 | 10240440502036 |
oct | 1367753103705 |
9 | 322246000541 |
10 | 102000003013 |
11 | 3a292384a57 |
12 | 17927717631 |
13 | 9806c8828c |
14 | 4d1891aa8d |
15 | 29beaed1ad |
hex | 17bfac87c5 |
102000003013 has 2 divisors, whose sum is σ = 102000003014. Its totient is φ = 102000003012.
The previous prime is 102000002959. The next prime is 102000003019. The reversal of 102000003013 is 310300000201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100231127649 + 1768875364 = 316593^2 + 42058^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102000003013 is a prime.
It is a super-3 number, since 3×1020000030133 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102000003019) 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, 51000001506 + 51000001507.
It is an arithmetic number, because the mean of its divisors is an integer number (51000001507).
Almost surely, 2102000003013 is an apocalyptic number.
It is an amenable number.
102000003013 is a deficient number, since it is larger than the sum of its proper divisors (1).
102000003013 is an equidigital number, since it uses as much as digits as its factorization.
102000003013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 102000003013 its reverse (310300000201), we get a palindrome (412300003214).
The spelling of 102000003013 in words is "one hundred two billion, three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.108 sec. • engine limits •