Base | Representation |
---|---|
bin | 111100100101010111… |
… | …1100110011100111101 |
3 | 110102211002202202022222 |
4 | 1321022233212130331 |
5 | 4112422332324013 |
6 | 135433555015125 |
7 | 12254034230234 |
oct | 1711257463475 |
9 | 412732682288 |
10 | 130103011133 |
11 | 501a38379a7 |
12 | 2126b29a4a5 |
13 | c365330a74 |
14 | 6423041b1b |
15 | 35b6e10508 |
hex | 1e4abe673d |
130103011133 has 2 divisors, whose sum is σ = 130103011134. Its totient is φ = 130103011132.
The previous prime is 130103011039. The next prime is 130103011147. The reversal of 130103011133 is 331110301031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95457517444 + 34645493689 = 308962^2 + 186133^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130103011133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130103011033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65051505566 + 65051505567.
It is an arithmetic number, because the mean of its divisors is an integer number (65051505567).
Almost surely, 2130103011133 is an apocalyptic number.
It is an amenable number.
130103011133 is a deficient number, since it is larger than the sum of its proper divisors (1).
130103011133 is an equidigital number, since it uses as much as digits as its factorization.
130103011133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 130103011133 its reverse (331110301031), we get a palindrome (461213312164).
The spelling of 130103011133 in words is "one hundred thirty billion, one hundred three million, eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.178 sec. • engine limits •