Base | Representation |
---|---|
bin | 1110101001001001110001… |
… | …10100001100000011110101 |
3 | 11020000022122212122120022212 |
4 | 13110210320310030003311 |
5 | 13210032230143214333 |
6 | 152252342453503205 |
7 | 6532253010450461 |
oct | 724447064140365 |
9 | 136008585576285 |
10 | 32200323023093 |
11 | a295097982075 |
12 | 374077b041b05 |
13 | 14c7628bc19c4 |
14 | 7d470aba54a1 |
15 | 3ac90e786448 |
hex | 1d4938d0c0f5 |
32200323023093 has 2 divisors, whose sum is σ = 32200323023094. Its totient is φ = 32200323023092.
The previous prime is 32200323022963. The next prime is 32200323023119. The reversal of 32200323023093 is 39032032300223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 26067335161924 + 6132987861169 = 5105618^2 + 2476487^2 .
It is an emirp because it is prime and its reverse (39032032300223) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32200323023093 - 220 = 32200321974517 is a prime.
It is a super-2 number, since 2×322003230230932 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32200323022093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16100161511546 + 16100161511547.
It is an arithmetic number, because the mean of its divisors is an integer number (16100161511547).
Almost surely, 232200323023093 is an apocalyptic number.
It is an amenable number.
32200323023093 is a deficient number, since it is larger than the sum of its proper divisors (1).
32200323023093 is an equidigital number, since it uses as much as digits as its factorization.
32200323023093 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 32.
The spelling of 32200323023093 in words is "thirty-two trillion, two hundred billion, three hundred twenty-three million, twenty-three thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •