Base | Representation |
---|---|
bin | 11110110110101101… |
… | …010110010101000001 |
3 | 10011111220011002021002 |
4 | 132312231112111001 |
5 | 1020322302043241 |
6 | 23115245141345 |
7 | 2251665210515 |
oct | 366655262501 |
9 | 104456132232 |
10 | 33130112321 |
11 | 130610a2819 |
12 | 650725a855 |
13 | 317ca04277 |
14 | 1864040145 |
15 | cdd81e89b |
hex | 7b6b56541 |
33130112321 has 2 divisors, whose sum is σ = 33130112322. Its totient is φ = 33130112320.
The previous prime is 33130112311. The next prime is 33130112357. The reversal of 33130112321 is 12321103133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 30298276096 + 2831836225 = 174064^2 + 53215^2 .
It is a cyclic number.
It is not a de Polignac number, because 33130112321 - 210 = 33130111297 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 33130112293 and 33130112302.
It is not a weakly prime, because it can be changed into another prime (33130112311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16565056160 + 16565056161.
It is an arithmetic number, because the mean of its divisors is an integer number (16565056161).
Almost surely, 233130112321 is an apocalyptic number.
It is an amenable number.
33130112321 is a deficient number, since it is larger than the sum of its proper divisors (1).
33130112321 is an equidigital number, since it uses as much as digits as its factorization.
33130112321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 33130112321 its reverse (12321103133), we get a palindrome (45451215454).
The spelling of 33130112321 in words is "thirty-three billion, one hundred thirty million, one hundred twelve thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •