Base | Representation |
---|---|
bin | 1110100111010000111011… |
… | …10000000101011011011001 |
3 | 11012210010012101011201122102 |
4 | 13103220131300011123121 |
5 | 13203001342234444311 |
6 | 152202452552533145 |
7 | 6524465161633544 |
oct | 723503560053331 |
9 | 135703171151572 |
10 | 32135444453081 |
11 | a26a624696172 |
12 | 37300933b11b5 |
13 | 14c14898109c8 |
14 | 7d151441d85b |
15 | 3aadb3ab643b |
hex | 1d3a1dc056d9 |
32135444453081 has 2 divisors, whose sum is σ = 32135444453082. Its totient is φ = 32135444453080.
The previous prime is 32135444452999. The next prime is 32135444453141. The reversal of 32135444453081 is 18035444453123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 28887303345481 + 3248141107600 = 5374691^2 + 1802260^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32135444453081 is a prime.
It is a super-2 number, since 2×321354444530812 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32135444453681) 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, 16067722226540 + 16067722226541.
It is an arithmetic number, because the mean of its divisors is an integer number (16067722226541).
Almost surely, 232135444453081 is an apocalyptic number.
It is an amenable number.
32135444453081 is a deficient number, since it is larger than the sum of its proper divisors (1).
32135444453081 is an equidigital number, since it uses as much as digits as its factorization.
32135444453081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2764800, while the sum is 47.
The spelling of 32135444453081 in words is "thirty-two trillion, one hundred thirty-five billion, four hundred forty-four million, four hundred fifty-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •