Base | Representation |
---|---|
bin | 111100101001001010… |
… | …0111000010100001101 |
3 | 110110010222010211202212 |
4 | 1321102110320110031 |
5 | 4113202414133031 |
6 | 135454341400205 |
7 | 12260140432523 |
oct | 1712224702415 |
9 | 413128124685 |
10 | 130230224141 |
11 | 50259625a16 |
12 | 212a5a09065 |
13 | c3857b1b34 |
14 | 6435cb8313 |
15 | 35c318d12b |
hex | 1e5253850d |
130230224141 has 2 divisors, whose sum is σ = 130230224142. Its totient is φ = 130230224140.
The previous prime is 130230224083. The next prime is 130230224153. The reversal of 130230224141 is 141422032031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 129728912041 + 501312100 = 360179^2 + 22390^2 .
It is a cyclic number.
It is not a de Polignac number, because 130230224141 - 230 = 129156482317 is a prime.
It is a super-2 number, since 2×1302302241412 (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 (130230224161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65115112070 + 65115112071.
It is an arithmetic number, because the mean of its divisors is an integer number (65115112071).
Almost surely, 2130230224141 is an apocalyptic number.
It is an amenable number.
130230224141 is a deficient number, since it is larger than the sum of its proper divisors (1).
130230224141 is an equidigital number, since it uses as much as digits as its factorization.
130230224141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 130230224141 its reverse (141422032031), we get a palindrome (271652256172).
The spelling of 130230224141 in words is "one hundred thirty billion, two hundred thirty million, two hundred twenty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •