Base | Representation |
---|---|
bin | 1110111010000010101000… |
… | …10100101111111000111101 |
3 | 11022001210110201210210002121 |
4 | 13131001110110233320331 |
5 | 13244034134403101003 |
6 | 153415111353122541 |
7 | 6622214645120563 |
oct | 735012424577075 |
9 | 138053421723077 |
10 | 32780605128253 |
11 | a4991a4008404 |
12 | 38151263b9451 |
13 | 153a2757481c8 |
14 | 8148383d9a33 |
15 | 3bca7350ecbd |
hex | 1dd05452fe3d |
32780605128253 has 2 divisors, whose sum is σ = 32780605128254. Its totient is φ = 32780605128252.
The previous prime is 32780605128251. The next prime is 32780605128259. The reversal of 32780605128253 is 35282150608723.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21916975944249 + 10863629184004 = 4681557^2 + 3296002^2 .
It is a cyclic number.
It is not a de Polignac number, because 32780605128253 - 21 = 32780605128251 is a prime.
Together with 32780605128251, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 32780605128253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32780605128251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16390302564126 + 16390302564127.
It is an arithmetic number, because the mean of its divisors is an integer number (16390302564127).
Almost surely, 232780605128253 is an apocalyptic number.
It is an amenable number.
32780605128253 is a deficient number, since it is larger than the sum of its proper divisors (1).
32780605128253 is an equidigital number, since it uses as much as digits as its factorization.
32780605128253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4838400, while the sum is 52.
The spelling of 32780605128253 in words is "thirty-two trillion, seven hundred eighty billion, six hundred five million, one hundred twenty-eight thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •