Base | Representation |
---|---|
bin | 1110110010010000101111… |
… | …11001000110001110100001 |
3 | 11021010020112000012200102102 |
4 | 13121020113321012032201 |
5 | 13230144221114240101 |
6 | 153052223314500145 |
7 | 6564002651626325 |
oct | 731102771061641 |
9 | 137106460180372 |
10 | 32513303274401 |
11 | a3a58a6095294 |
12 | 3791367594655 |
13 | 151acb6c99391 |
14 | 80591bbb1985 |
15 | 3b5b2b79586b |
hex | 1d9217e463a1 |
32513303274401 has 2 divisors, whose sum is σ = 32513303274402. Its totient is φ = 32513303274400.
The previous prime is 32513303274341. The next prime is 32513303274479. The reversal of 32513303274401 is 10447230331523.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26891733404176 + 5621569870225 = 5185724^2 + 2370985^2 .
It is an emirp because it is prime and its reverse (10447230331523) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32513303274401 is a prime.
It is a super-2 number, since 2×325133032744012 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (32513303274901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16256651637200 + 16256651637201.
It is an arithmetic number, because the mean of its divisors is an integer number (16256651637201).
Almost surely, 232513303274401 is an apocalyptic number.
It is an amenable number.
32513303274401 is a deficient number, since it is larger than the sum of its proper divisors (1).
32513303274401 is an equidigital number, since it uses as much as digits as its factorization.
32513303274401 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 181440, while the sum is 38.
The spelling of 32513303274401 in words is "thirty-two trillion, five hundred thirteen billion, three hundred three million, two hundred seventy-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •