Base | Representation |
---|---|
bin | 1110110100111001101100… |
… | …11111110000110100010111 |
3 | 11021102220122120212121110022 |
4 | 13122130312133300310113 |
5 | 13233141003311240043 |
6 | 153202024221015355 |
7 | 6603363534126443 |
oct | 732346637606427 |
9 | 137386576777408 |
10 | 32604011040023 |
11 | a43031327a145 |
12 | 37a6a613b455b |
13 | 1526711619587 |
14 | 80a084aa9823 |
15 | 3b8189d2a868 |
hex | 1da7367f0d17 |
32604011040023 has 2 divisors, whose sum is σ = 32604011040024. Its totient is φ = 32604011040022.
The previous prime is 32604011040017. The next prime is 32604011040031. The reversal of 32604011040023 is 32004011040623.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 32604011040023 - 236 = 32535291563287 is a prime.
It is a super-2 number, since 2×326040110400232 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 32604011039974 and 32604011040001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (32604011940023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16302005520011 + 16302005520012.
It is an arithmetic number, because the mean of its divisors is an integer number (16302005520012).
Almost surely, 232604011040023 is an apocalyptic number.
32604011040023 is a deficient number, since it is larger than the sum of its proper divisors (1).
32604011040023 is an equidigital number, since it uses as much as digits as its factorization.
32604011040023 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 32604011040023 its reverse (32004011040623), we get a palindrome (64608022080646).
The spelling of 32604011040023 in words is "thirty-two trillion, six hundred four billion, eleven million, forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •