Base | Representation |
---|---|
bin | 1110100110010100000010… |
… | …10100111000011010001001 |
3 | 11012122222211012202221201211 |
4 | 13103022001110320122021 |
5 | 13201432420324230342 |
6 | 152135445135013121 |
7 | 6522230126520241 |
oct | 723120124703211 |
9 | 135588735687654 |
10 | 32102755305097 |
11 | a25777a4a8494 |
12 | 372588b96a1a1 |
13 | 14bb37a2917a9 |
14 | 7cdad2ba8b21 |
15 | 3aa0edd4cc17 |
hex | 1d3281538689 |
32102755305097 has 2 divisors, whose sum is σ = 32102755305098. Its totient is φ = 32102755305096.
The previous prime is 32102755305053. The next prime is 32102755305121. The reversal of 32102755305097 is 79050355720123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32049853465081 + 52901840016 = 5661259^2 + 230004^2 .
It is a cyclic number.
It is not a de Polignac number, because 32102755305097 - 219 = 32102754780809 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32102755305097.
It is not a weakly prime, because it can be changed into another prime (32102755305007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16051377652548 + 16051377652549.
It is an arithmetic number, because the mean of its divisors is an integer number (16051377652549).
Almost surely, 232102755305097 is an apocalyptic number.
It is an amenable number.
32102755305097 is a deficient number, since it is larger than the sum of its proper divisors (1).
32102755305097 is an equidigital number, since it uses as much as digits as its factorization.
32102755305097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1984500, while the sum is 49.
The spelling of 32102755305097 in words is "thirty-two trillion, one hundred two billion, seven hundred fifty-five million, three hundred five thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •