Base | Representation |
---|---|
bin | 1110100111001000110111… |
… | …00001001000110110110001 |
3 | 11012202201000102220222110022 |
4 | 13103210123201020312301 |
5 | 13202414004133410413 |
6 | 152200455025413225 |
7 | 6524252623540562 |
oct | 723443341106661 |
9 | 135681012828408 |
10 | 32131112013233 |
11 | a268801090a72 |
12 | 372b28449a215 |
13 | 14c0c49073b2c |
14 | 7d1222c90169 |
15 | 3aac0d575608 |
hex | 1d391b848db1 |
32131112013233 has 2 divisors, whose sum is σ = 32131112013234. Its totient is φ = 32131112013232.
The previous prime is 32131112013211. The next prime is 32131112013263. The reversal of 32131112013233 is 33231021113123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20789149678144 + 11341962335089 = 4559512^2 + 3367783^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32131112013233 is a prime.
It is a super-2 number, since 2×321311120132332 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32131112013263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16065556006616 + 16065556006617.
It is an arithmetic number, because the mean of its divisors is an integer number (16065556006617).
Almost surely, 232131112013233 is an apocalyptic number.
It is an amenable number.
32131112013233 is a deficient number, since it is larger than the sum of its proper divisors (1).
32131112013233 is an equidigital number, since it uses as much as digits as its factorization.
32131112013233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 26.
Adding to 32131112013233 its reverse (33231021113123), we get a palindrome (65362133126356).
The spelling of 32131112013233 in words is "thirty-two trillion, one hundred thirty-one billion, one hundred twelve million, thirteen thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •