Base | Representation |
---|---|
bin | 1110100111001010111110… |
… | …00000001011010001111001 |
3 | 11012202210221100101012101222 |
4 | 13103211133000023101321 |
5 | 13202423314010114342 |
6 | 152201203232521425 |
7 | 6524322652265144 |
oct | 723453700132171 |
9 | 135683840335358 |
10 | 32132244223097 |
11 | a2692321a5aa7 |
12 | 372b53b6b0275 |
13 | 14c10997c15b5 |
14 | 7d12cd3b505b |
15 | 3aac77b6eed2 |
hex | 1d395f00b479 |
32132244223097 has 2 divisors, whose sum is σ = 32132244223098. Its totient is φ = 32132244223096.
The previous prime is 32132244223081. The next prime is 32132244223129. The reversal of 32132244223097 is 79032244223123.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 31154303212816 + 977941010281 = 5581604^2 + 988909^2 .
It is a cyclic number.
It is not a de Polignac number, because 32132244223097 - 24 = 32132244223081 is a prime.
It is a super-2 number, since 2×321322442230972 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32132244223697) 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, 16066122111548 + 16066122111549.
It is an arithmetic number, because the mean of its divisors is an integer number (16066122111549).
Almost surely, 232132244223097 is an apocalyptic number.
It is an amenable number.
32132244223097 is a deficient number, since it is larger than the sum of its proper divisors (1).
32132244223097 is an equidigital number, since it uses as much as digits as its factorization.
32132244223097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 870912, while the sum is 44.
The spelling of 32132244223097 in words is "thirty-two trillion, one hundred thirty-two billion, two hundred forty-four million, two hundred twenty-three thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •