Base | Representation |
---|---|
bin | 111100101000010111… |
… | …0010101000110100101 |
3 | 110110002002120001100011 |
4 | 1321100232111012211 |
5 | 4113124023404341 |
6 | 135451541250221 |
7 | 12256363065622 |
oct | 1712056250645 |
9 | 413062501304 |
10 | 130203341221 |
11 | 50245434428 |
12 | 21298a03971 |
13 | c38005b895 |
14 | 64324bb349 |
15 | 35c0b2cb81 |
hex | 1e50b951a5 |
130203341221 has 2 divisors, whose sum is σ = 130203341222. Its totient is φ = 130203341220.
The previous prime is 130203341201. The next prime is 130203341237. The reversal of 130203341221 is 122143302031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129783665025 + 419676196 = 360255^2 + 20486^2 .
It is a cyclic number.
It is not a de Polignac number, because 130203341221 - 211 = 130203339173 is a prime.
It is a super-2 number, since 2×1302033412212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130203341192 and 130203341201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130203341201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65101670610 + 65101670611.
It is an arithmetic number, because the mean of its divisors is an integer number (65101670611).
Almost surely, 2130203341221 is an apocalyptic number.
It is an amenable number.
130203341221 is a deficient number, since it is larger than the sum of its proper divisors (1).
130203341221 is an equidigital number, since it uses as much as digits as its factorization.
130203341221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 130203341221 its reverse (122143302031), we get a palindrome (252346643252).
The spelling of 130203341221 in words is "one hundred thirty billion, two hundred three million, three hundred forty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •