Base | Representation |
---|---|
bin | 1110100101001100001111… |
… | …11010000111111000101101 |
3 | 11012112022022222220200011002 |
4 | 13102212013322013320231 |
5 | 13200320001010303303 |
6 | 152110032321210045 |
7 | 6516364016533145 |
oct | 722460772077055 |
9 | 135468288820132 |
10 | 32064211025453 |
11 | a2423a0236722 |
12 | 371a313490925 |
13 | 14b7846999a29 |
14 | 7cbcb7a95925 |
15 | 3a90e5065788 |
hex | 1d2987e87e2d |
32064211025453 has 2 divisors, whose sum is σ = 32064211025454. Its totient is φ = 32064211025452.
The previous prime is 32064211025387. The next prime is 32064211025459. The reversal of 32064211025453 is 35452011246023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31621131753289 + 443079272164 = 5623267^2 + 665642^2 .
It is an emirp because it is prime and its reverse (35452011246023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 32064211025453 - 210 = 32064211024429 is a prime.
It is a super-2 number, since 2×320642110254532 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32064211025459) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16032105512726 + 16032105512727.
It is an arithmetic number, because the mean of its divisors is an integer number (16032105512727).
Almost surely, 232064211025453 is an apocalyptic number.
It is an amenable number.
32064211025453 is a deficient number, since it is larger than the sum of its proper divisors (1).
32064211025453 is an equidigital number, since it uses as much as digits as its factorization.
32064211025453 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172800, while the sum is 38.
The spelling of 32064211025453 in words is "thirty-two trillion, sixty-four billion, two hundred eleven million, twenty-five thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •