Base | Representation |
---|---|
bin | 111100101100001101… |
… | …0000001100111001001 |
3 | 110110102002002121001111 |
4 | 1321120122001213021 |
5 | 4113410023024413 |
6 | 135512424050321 |
7 | 12262516505053 |
oct | 1713032014711 |
9 | 413362077044 |
10 | 130332236233 |
11 | 50301171131 |
12 | 213140039a1 |
13 | c3a097b414 |
14 | 64456708d3 |
15 | 35cc0ddd3d |
hex | 1e586819c9 |
130332236233 has 2 divisors, whose sum is σ = 130332236234. Its totient is φ = 130332236232.
The previous prime is 130332236183. The next prime is 130332236249. The reversal of 130332236233 is 332632233031.
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., 91583101129 + 38749135104 = 302627^2 + 196848^2 .
It is a cyclic number.
It is not a de Polignac number, because 130332236233 - 233 = 121742301641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130332236195 and 130332236204.
It is not a weakly prime, because it can be changed into another prime (130332236263) 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, 65166118116 + 65166118117.
It is an arithmetic number, because the mean of its divisors is an integer number (65166118117).
Almost surely, 2130332236233 is an apocalyptic number.
It is an amenable number.
130332236233 is a deficient number, since it is larger than the sum of its proper divisors (1).
130332236233 is an equidigital number, since it uses as much as digits as its factorization.
130332236233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 31.
Adding to 130332236233 its reverse (332632233031), we get a palindrome (462964469264).
The spelling of 130332236233 in words is "one hundred thirty billion, three hundred thirty-two million, two hundred thirty-six thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •