Base | Representation |
---|---|
bin | 1110100111001100011000… |
… | …01111000100101110011001 |
3 | 11012202212220020100022002211 |
4 | 13103212030033010232121 |
5 | 13202431342243300004 |
6 | 152201410422155121 |
7 | 6524350525540315 |
oct | 723461417045631 |
9 | 135685806308084 |
10 | 32133003103129 |
11 | a269591600885 |
12 | 372b711882aa1 |
13 | 14c118aaa7c36 |
14 | 7d13620b8b45 |
15 | 3aacbe5c3504 |
hex | 1d398c3c4b99 |
32133003103129 has 2 divisors, whose sum is σ = 32133003103130. Its totient is φ = 32133003103128.
The previous prime is 32133003103109. The next prime is 32133003103139. The reversal of 32133003103129 is 92130130033123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21039440613129 + 11093562490000 = 4586877^2 + 3330700^2 .
It is a cyclic number.
It is not a de Polignac number, because 32133003103129 - 215 = 32133003070361 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32133003103129.
It is not a weakly prime, because it can be changed into another prime (32133003103109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16066501551564 + 16066501551565.
It is an arithmetic number, because the mean of its divisors is an integer number (16066501551565).
Almost surely, 232133003103129 is an apocalyptic number.
It is an amenable number.
32133003103129 is a deficient number, since it is larger than the sum of its proper divisors (1).
32133003103129 is an equidigital number, since it uses as much as digits as its factorization.
32133003103129 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 31.
The spelling of 32133003103129 in words is "thirty-two trillion, one hundred thirty-three billion, three million, one hundred three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •