Base | Representation |
---|---|
bin | 111100101011100100… |
… | …1000111001100100001 |
3 | 110110100121011222022121 |
4 | 1321113021013030201 |
5 | 4113334110303231 |
6 | 135510345304241 |
7 | 12262141304032 |
oct | 1712711071441 |
9 | 413317158277 |
10 | 130311025441 |
11 | 502a01a4153 |
12 | 21308a95081 |
13 | c399462b5c |
14 | 644290ca89 |
15 | 35ca2ee311 |
hex | 1e57247321 |
130311025441 has 4 divisors (see below), whose sum is σ = 130311825300. Its totient is φ = 130310225584.
The previous prime is 130311025421. The next prime is 130311025489. The reversal of 130311025441 is 144520113031.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 110409998400 + 19901027041 = 332280^2 + 141071^2 .
It is a cyclic number.
It is not a de Polignac number, because 130311025441 - 217 = 130310894369 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130311025421) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58246 + ... + 513823.
It is an arithmetic number, because the mean of its divisors is an integer number (32577956325).
Almost surely, 2130311025441 is an apocalyptic number.
It is an amenable number.
130311025441 is a deficient number, since it is larger than the sum of its proper divisors (799859).
130311025441 is an equidigital number, since it uses as much as digits as its factorization.
130311025441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 799858.
The product of its (nonzero) digits is 1440, while the sum is 25.
Adding to 130311025441 its reverse (144520113031), we get a palindrome (274831138472).
The spelling of 130311025441 in words is "one hundred thirty billion, three hundred eleven million, twenty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •