Base | Representation |
---|---|
bin | 11101100011111100000010… |
… | …101100010111000000011001 |
3 | 122001100010021112011212212202 |
4 | 131203330002230113000121 |
5 | 114020113111022401332 |
6 | 1140303051525215545 |
7 | 36246062226452021 |
oct | 3543740254270031 |
9 | 561303245155782 |
10 | 130013000200217 |
11 | 384762271aa052 |
12 | 126b94828615b5 |
13 | 57712339c7054 |
14 | 241693c97aa81 |
15 | 1006e0aa39a62 |
hex | 763f02b17019 |
130013000200217 has 2 divisors, whose sum is σ = 130013000200218. Its totient is φ = 130013000200216.
The previous prime is 130013000200201. The next prime is 130013000200271. The reversal of 130013000200217 is 712002000310031.
Together with next prime (130013000200271) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 127358199225481 + 2654800974736 = 11285309^2 + 1629356^2 .
It is a cyclic number.
It is not a de Polignac number, because 130013000200217 - 24 = 130013000200201 is a prime.
It is not a weakly prime, because it can be changed into another prime (130013000205217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65006500100108 + 65006500100109.
It is an arithmetic number, because the mean of its divisors is an integer number (65006500100109).
Almost surely, 2130013000200217 is an apocalyptic number.
It is an amenable number.
130013000200217 is a deficient number, since it is larger than the sum of its proper divisors (1).
130013000200217 is an equidigital number, since it uses as much as digits as its factorization.
130013000200217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 130013000200217 its reverse (712002000310031), we get a palindrome (842015000510248).
The spelling of 130013000200217 in words is "one hundred thirty trillion, thirteen billion, two hundred thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •