Base | Representation |
---|---|
bin | 111100101000101001… |
… | …1100011101011100001 |
3 | 110110002202220212012221 |
4 | 1321101103203223201 |
5 | 4113134023202012 |
6 | 135452530351041 |
7 | 12256542042622 |
oct | 1712123435341 |
9 | 413082825187 |
10 | 130213100257 |
11 | 5024a99a549 |
12 | 212a012b481 |
13 | c382097866 |
14 | 64338dba49 |
15 | 35c1909507 |
hex | 1e514e3ae1 |
130213100257 has 2 divisors, whose sum is σ = 130213100258. Its totient is φ = 130213100256.
The previous prime is 130213100249. The next prime is 130213100263. The reversal of 130213100257 is 752001312031.
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., 123194682081 + 7018418176 = 350991^2 + 83776^2 .
It is a cyclic number.
It is not a de Polignac number, because 130213100257 - 23 = 130213100249 is a prime.
It is a super-3 number, since 3×1302131002573 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (130213100267) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65106550128 + 65106550129.
It is an arithmetic number, because the mean of its divisors is an integer number (65106550129).
Almost surely, 2130213100257 is an apocalyptic number.
It is an amenable number.
130213100257 is a deficient number, since it is larger than the sum of its proper divisors (1).
130213100257 is an equidigital number, since it uses as much as digits as its factorization.
130213100257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 25.
Adding to 130213100257 its reverse (752001312031), we get a palindrome (882214412288).
The spelling of 130213100257 in words is "one hundred thirty billion, two hundred thirteen million, one hundred thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •