Base | Representation |
---|---|
bin | 11101111010000101… |
… | …110000110101100101 |
3 | 10001220000110121121212 |
4 | 131322011300311211 |
5 | 1011231423232211 |
6 | 22430315121205 |
7 | 2214535602416 |
oct | 357205606545 |
9 | 101800417555 |
10 | 32113102181 |
11 | 1268a010a76 |
12 | 6282743205 |
13 | 304a0bc814 |
14 | 17a8d4580d |
15 | c7e3cd38b |
hex | 77a170d65 |
32113102181 has 2 divisors, whose sum is σ = 32113102182. Its totient is φ = 32113102180.
The previous prime is 32113102169. The next prime is 32113102183. The reversal of 32113102181 is 18120131123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17196388225 + 14916713956 = 131135^2 + 122134^2 .
It is a cyclic number.
It is not a de Polignac number, because 32113102181 - 230 = 31039360357 is a prime.
It is a super-4 number, since 4×321131021814 (a number of 43 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
Together with 32113102183, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32113102183) 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, 16056551090 + 16056551091.
It is an arithmetic number, because the mean of its divisors is an integer number (16056551091).
Almost surely, 232113102181 is an apocalyptic number.
It is an amenable number.
32113102181 is a deficient number, since it is larger than the sum of its proper divisors (1).
32113102181 is an equidigital number, since it uses as much as digits as its factorization.
32113102181 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 23.
The spelling of 32113102181 in words is "thirty-two billion, one hundred thirteen million, one hundred two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •