Base | Representation |
---|---|
bin | 111100101001000010… |
… | …1001100011000110101 |
3 | 110110010200101221001022 |
4 | 1321102011030120311 |
5 | 4113200341041203 |
6 | 135454113310525 |
7 | 12260060455112 |
oct | 1712205143065 |
9 | 413120357038 |
10 | 130226112053 |
11 | 502572774a4 |
12 | 212a4565445 |
13 | c3849a224b |
14 | 6435527909 |
15 | 35c2b29a38 |
hex | 1e5214c635 |
130226112053 has 2 divisors, whose sum is σ = 130226112054. Its totient is φ = 130226112052.
The previous prime is 130226112047. The next prime is 130226112077. The reversal of 130226112053 is 350211622031.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 119689705444 + 10536406609 = 345962^2 + 102647^2 .
It is an emirp because it is prime and its reverse (350211622031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130226112053 - 214 = 130226095669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130226112083) 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, 65113056026 + 65113056027.
It is an arithmetic number, because the mean of its divisors is an integer number (65113056027).
Almost surely, 2130226112053 is an apocalyptic number.
It is an amenable number.
130226112053 is a deficient number, since it is larger than the sum of its proper divisors (1).
130226112053 is an equidigital number, since it uses as much as digits as its factorization.
130226112053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
Adding to 130226112053 its reverse (350211622031), we get a palindrome (480437734084).
The spelling of 130226112053 in words is "one hundred thirty billion, two hundred twenty-six million, one hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •