Base | Representation |
---|---|
bin | 101111111101111100… |
… | …0000000111101010101 |
3 | 100211212221111211212011 |
4 | 1133323320000331111 |
5 | 3141431030404023 |
6 | 115153330024221 |
7 | 10304453443435 |
oct | 1377370007525 |
9 | 324787454764 |
10 | 103010013013 |
11 | 3a760515466 |
12 | 17b69a18071 |
13 | 99382bb72b |
14 | 4db2b122c5 |
15 | 2a2d60a50d |
hex | 17fbe00f55 |
103010013013 has 2 divisors, whose sum is σ = 103010013014. Its totient is φ = 103010013012.
The previous prime is 103010012983. The next prime is 103010013017. The reversal of 103010013013 is 310310010301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 101637903249 + 1372109764 = 318807^2 + 37042^2 .
It is a cyclic number.
It is not a de Polignac number, because 103010013013 - 213 = 103010004821 is a prime.
It is a super-2 number, since 2×1030100130132 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103010012984 and 103010013002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103010013017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51505006506 + 51505006507.
It is an arithmetic number, because the mean of its divisors is an integer number (51505006507).
Almost surely, 2103010013013 is an apocalyptic number.
It is an amenable number.
103010013013 is a deficient number, since it is larger than the sum of its proper divisors (1).
103010013013 is an equidigital number, since it uses as much as digits as its factorization.
103010013013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 103010013013 its reverse (310310010301), we get a palindrome (413320023314).
The spelling of 103010013013 in words is "one hundred three billion, ten million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •