Base | Representation |
---|---|
bin | 11101110100100011… |
… | …000001111111010001 |
3 | 10001122112111012010122 |
4 | 131310203001333101 |
5 | 1011034122030223 |
6 | 22413154040025 |
7 | 2212326312131 |
oct | 356443017721 |
9 | 101575435118 |
10 | 32020111313 |
11 | 12641577613 |
12 | 6257579015 |
13 | 3033a61438 |
14 | 179a85aac1 |
15 | c761605c8 |
hex | 7748c1fd1 |
32020111313 has 2 divisors, whose sum is σ = 32020111314. Its totient is φ = 32020111312.
The previous prime is 32020111241. The next prime is 32020111367. The reversal of 32020111313 is 31311102023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16330795264 + 15689316049 = 127792^2 + 125257^2 .
It is an emirp because it is prime and its reverse (31311102023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32020111313 - 222 = 32015917009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32020111291 and 32020111300.
It is not a weakly prime, because it can be changed into another prime (32020111373) 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, 16010055656 + 16010055657.
It is an arithmetic number, because the mean of its divisors is an integer number (16010055657).
Almost surely, 232020111313 is an apocalyptic number.
It is an amenable number.
32020111313 is a deficient number, since it is larger than the sum of its proper divisors (1).
32020111313 is an equidigital number, since it uses as much as digits as its factorization.
32020111313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 32020111313 its reverse (31311102023), we get a palindrome (63331213336).
The spelling of 32020111313 in words is "thirty-two billion, twenty million, one hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.174 sec. • engine limits •