Base | Representation |
---|---|
bin | 11101100101011000010111… |
… | …010111000111110010100101 |
3 | 122001200121011010122112222012 |
4 | 131211120113113013302211 |
5 | 114023224121041432323 |
6 | 1140420404330444005 |
7 | 36256201622202446 |
oct | 3545302727076245 |
9 | 561617133575865 |
10 | 130112131202213 |
11 | 38504277058086 |
12 | 12714729593605 |
13 | 577a6a1476194 |
14 | 241b6644312cd |
15 | 10097ad81d678 |
hex | 7656175c7ca5 |
130112131202213 has 2 divisors, whose sum is σ = 130112131202214. Its totient is φ = 130112131202212.
The previous prime is 130112131202191. The next prime is 130112131202219. The reversal of 130112131202213 is 312202131211031.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 84121585055524 + 45990546146689 = 9171782^2 + 6781633^2 .
It is a cyclic number.
It is not a de Polignac number, because 130112131202213 - 234 = 130094951333029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130112131202219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65056065601106 + 65056065601107.
It is an arithmetic number, because the mean of its divisors is an integer number (65056065601107).
Almost surely, 2130112131202213 is an apocalyptic number.
It is an amenable number.
130112131202213 is a deficient number, since it is larger than the sum of its proper divisors (1).
130112131202213 is an equidigital number, since it uses as much as digits as its factorization.
130112131202213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 130112131202213 its reverse (312202131211031), we get a palindrome (442314262413244).
The spelling of 130112131202213 in words is "one hundred thirty trillion, one hundred twelve billion, one hundred thirty-one million, two hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •