Base | Representation |
---|---|
bin | 1110110000111000011110… |
… | …11010110001110010001001 |
3 | 11020221201012112120112000001 |
4 | 13120130033122301302021 |
5 | 13223410144103441421 |
6 | 153014345223043001 |
7 | 6560404450466005 |
oct | 730341732616211 |
9 | 136851175515001 |
10 | 32465916468361 |
11 | a387799509572 |
12 | 37841418a0461 |
13 | 15166a473bb8c |
14 | 803504559705 |
15 | 3b47a653a691 |
hex | 1d870f6b1c89 |
32465916468361 has 2 divisors, whose sum is σ = 32465916468362. Its totient is φ = 32465916468360.
The previous prime is 32465916468347. The next prime is 32465916468367. The reversal of 32465916468361 is 16386461956423.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31500156250000 + 965760218361 = 5612500^2 + 982731^2 .
It is a cyclic number.
It is not a de Polignac number, because 32465916468361 - 213 = 32465916460169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32465916468293 and 32465916468302.
It is not a weakly prime, because it can be changed into another prime (32465916468367) 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, 16232958234180 + 16232958234181.
It is an arithmetic number, because the mean of its divisors is an integer number (16232958234181).
Almost surely, 232465916468361 is an apocalyptic number.
It is an amenable number.
32465916468361 is a deficient number, since it is larger than the sum of its proper divisors (1).
32465916468361 is an equidigital number, since it uses as much as digits as its factorization.
32465916468361 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 134369280, while the sum is 64.
The spelling of 32465916468361 in words is "thirty-two trillion, four hundred sixty-five billion, nine hundred sixteen million, four hundred sixty-eight thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •