Base | Representation |
---|---|
bin | 1110100110111010010111… |
… | …01111101111001101010001 |
3 | 11012201221221011222022220001 |
4 | 13103131023233233031101 |
5 | 13202302040242241423 |
6 | 152153131000050001 |
7 | 6523556044036321 |
oct | 723351357571521 |
9 | 135657834868801 |
10 | 32123331212113 |
11 | a265479019a19 |
12 | 3729872763901 |
13 | 14c02a907a8bb |
14 | 7d0ac5765281 |
15 | 3aa905427cad |
hex | 1d374bbef351 |
32123331212113 has 2 divisors, whose sum is σ = 32123331212114. Its totient is φ = 32123331212112.
The previous prime is 32123331212107. The next prime is 32123331212197. The reversal of 32123331212113 is 31121213332123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31963509562384 + 159821649729 = 5653628^2 + 399777^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32123331212113 is a prime.
It is a super-2 number, since 2×321233312121132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32123331212213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16061665606056 + 16061665606057.
It is an arithmetic number, because the mean of its divisors is an integer number (16061665606057).
Almost surely, 232123331212113 is an apocalyptic number.
It is an amenable number.
32123331212113 is a deficient number, since it is larger than the sum of its proper divisors (1).
32123331212113 is an equidigital number, since it uses as much as digits as its factorization.
32123331212113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3888, while the sum is 28.
Adding to 32123331212113 its reverse (31121213332123), we get a palindrome (63244544544236).
The spelling of 32123331212113 in words is "thirty-two trillion, one hundred twenty-three billion, three hundred thirty-one million, two hundred twelve thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •