Base | Representation |
---|---|
bin | 11101111010000110… |
… | …001110001010101001 |
3 | 10001220000200201102012 |
4 | 131322012032022221 |
5 | 1011231441103223 |
6 | 22430321445305 |
7 | 2214536612564 |
oct | 357206161251 |
9 | 101800621365 |
10 | 32113222313 |
11 | 1268a093257 |
12 | 62827a0835 |
13 | 304a1323c3 |
14 | 17a8d774db |
15 | c7e403c78 |
hex | 77a18e2a9 |
32113222313 has 2 divisors, whose sum is σ = 32113222314. Its totient is φ = 32113222312.
The previous prime is 32113222283. The next prime is 32113222331. The reversal of 32113222313 is 31322231123.
Together with next prime (32113222331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31931188249 + 182034064 = 178693^2 + 13492^2 .
It is a cyclic number.
It is not a de Polignac number, because 32113222313 - 222 = 32109028009 is a prime.
It is a super-3 number, since 3×321132223133 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (32113242313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16056611156 + 16056611157.
It is an arithmetic number, because the mean of its divisors is an integer number (16056611157).
Almost surely, 232113222313 is an apocalyptic number.
It is an amenable number.
32113222313 is a deficient number, since it is larger than the sum of its proper divisors (1).
32113222313 is an equidigital number, since it uses as much as digits as its factorization.
32113222313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1296, while the sum is 23.
Adding to 32113222313 its reverse (31322231123), we get a palindrome (63435453436).
The spelling of 32113222313 in words is "thirty-two billion, one hundred thirteen million, two hundred twenty-two thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •