Base | Representation |
---|---|
bin | 1110101100110000001011… |
… | …01111100001101010000001 |
3 | 11020110010221112201221211201 |
4 | 13112120011233201222001 |
5 | 13214044043133330101 |
6 | 152425241101541201 |
7 | 6544222232311336 |
oct | 726300557415201 |
9 | 136403845657751 |
10 | 32324020214401 |
11 | a3325a37a87a3 |
12 | 3760740b74801 |
13 | 15061b0058426 |
14 | 7da6c315a98d |
15 | 3b0c4e0eae01 |
hex | 1d6605be1a81 |
32324020214401 has 2 divisors, whose sum is σ = 32324020214402. Its totient is φ = 32324020214400.
The previous prime is 32324020214273. The next prime is 32324020214419. The reversal of 32324020214401 is 10441202042323.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 29361659449600 + 2962360764801 = 5418640^2 + 1721151^2 .
It is a cyclic number.
It is not a de Polignac number, because 32324020214401 - 27 = 32324020214273 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32324020214401.
It is not a weakly prime, because it can be changed into another prime (32324020214441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16162010107200 + 16162010107201.
It is an arithmetic number, because the mean of its divisors is an integer number (16162010107201).
Almost surely, 232324020214401 is an apocalyptic number.
It is an amenable number.
32324020214401 is a deficient number, since it is larger than the sum of its proper divisors (1).
32324020214401 is an equidigital number, since it uses as much as digits as its factorization.
32324020214401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 32324020214401 its reverse (10441202042323), we get a palindrome (42765222256724).
The spelling of 32324020214401 in words is "thirty-two trillion, three hundred twenty-four billion, twenty million, two hundred fourteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •