Base | Representation |
---|---|
bin | 11101101010001010111100… |
… | …101011010001100011001111 |
3 | 122002212001212000122221211122 |
4 | 131222022330223101203033 |
5 | 114044122311443141312 |
6 | 1141231525521111155 |
7 | 36322034364643136 |
oct | 3552127453214317 |
9 | 562761760587748 |
10 | 130441322240207 |
11 | 38620943896270 |
12 | 1276849aa884bb |
13 | 57a2743b99a24 |
14 | 242d57239c91d |
15 | 1013128aadb72 |
hex | 76a2bcad18cf |
130441322240207 has 4 divisors (see below), whose sum is σ = 142299624262056. Its totient is φ = 118583020218360.
The previous prime is 130441322240197. The next prime is 130441322240239. The reversal of 130441322240207 is 702042223144031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130441322240207 - 24 = 130441322240191 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130441322240107) 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, 5929151010908 + ... + 5929151010929.
It is an arithmetic number, because the mean of its divisors is an integer number (35574906065514).
Almost surely, 2130441322240207 is an apocalyptic number.
130441322240207 is a deficient number, since it is larger than the sum of its proper divisors (11858302021849).
130441322240207 is a wasteful number, since it uses less digits than its factorization.
130441322240207 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11858302021848.
The product of its (nonzero) digits is 64512, while the sum is 35.
Adding to 130441322240207 its reverse (702042223144031), we get a palindrome (832483545384238).
The spelling of 130441322240207 in words is "one hundred thirty trillion, four hundred forty-one billion, three hundred twenty-two million, two hundred forty thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •