Base | Representation |
---|---|
bin | 111100101001001100… |
… | …0101001100011001001 |
3 | 110110011001000001011212 |
4 | 1321102120221203021 |
5 | 4113203142242413 |
6 | 135454414502505 |
7 | 12260152016333 |
oct | 1712230514311 |
9 | 413131001155 |
10 | 130231212233 |
11 | 5025a140321 |
12 | 212a6204a35 |
13 | c385a697c5 |
14 | 6436094453 |
15 | 35c32d5ca8 |
hex | 1e526298c9 |
130231212233 has 2 divisors, whose sum is σ = 130231212234. Its totient is φ = 130231212232.
The previous prime is 130231212217. The next prime is 130231212313. The reversal of 130231212233 is 332212132031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 121328912329 + 8902299904 = 348323^2 + 94352^2 .
It is a cyclic number.
It is not a de Polignac number, because 130231212233 - 24 = 130231212217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130231212199 and 130231212208.
It is not a weakly prime, because it can be changed into another prime (130231214233) 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, 65115606116 + 65115606117.
It is an arithmetic number, because the mean of its divisors is an integer number (65115606117).
Almost surely, 2130231212233 is an apocalyptic number.
It is an amenable number.
130231212233 is a deficient number, since it is larger than the sum of its proper divisors (1).
130231212233 is an equidigital number, since it uses as much as digits as its factorization.
130231212233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 130231212233 its reverse (332212132031), we get a palindrome (462443344264).
The spelling of 130231212233 in words is "one hundred thirty billion, two hundred thirty-one million, two hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.429 sec. • engine limits •