Base | Representation |
---|---|
bin | 111100110111010000… |
… | …0111010101001001101 |
3 | 110111100221000112100212 |
4 | 1321232200322221031 |
5 | 4120140001011303 |
6 | 140013313532205 |
7 | 12304642241303 |
oct | 1715640725115 |
9 | 414327015325 |
10 | 130703141453 |
11 | 50481574775 |
12 | 213b8274065 |
13 | c42c773a71 |
14 | 647ca20273 |
15 | 35ee956ad8 |
hex | 1e6e83aa4d |
130703141453 has 2 divisors, whose sum is σ = 130703141454. Its totient is φ = 130703141452.
The previous prime is 130703141423. The next prime is 130703141461. The reversal of 130703141453 is 354141307031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124890146404 + 5812995049 = 353398^2 + 76243^2 .
It is an emirp because it is prime and its reverse (354141307031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130703141453 - 210 = 130703140429 is a prime.
It is a super-2 number, since 2×1307031414532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130703141423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65351570726 + 65351570727.
It is an arithmetic number, because the mean of its divisors is an integer number (65351570727).
Almost surely, 2130703141453 is an apocalyptic number.
It is an amenable number.
130703141453 is a deficient number, since it is larger than the sum of its proper divisors (1).
130703141453 is an equidigital number, since it uses as much as digits as its factorization.
130703141453 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 15120, while the sum is 32.
Adding to 130703141453 its reverse (354141307031), we get a palindrome (484844448484).
The spelling of 130703141453 in words is "one hundred thirty billion, seven hundred three million, one hundred forty-one thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •