Base | Representation |
---|---|
bin | 1110100110101110010000… |
… | …00100101001110001001001 |
3 | 11012201100010220101222110221 |
4 | 13103113020010221301021 |
5 | 13202200230221310144 |
6 | 152150133335110041 |
7 | 6523235626223446 |
oct | 723271004516111 |
9 | 135640126358427 |
10 | 32116827135049 |
11 | a2627406a7618 |
12 | 3728558512321 |
13 | 14bc7b07300a7 |
14 | 7d0669a1c9cd |
15 | 3aa67441dd84 |
hex | 1d35c8129c49 |
32116827135049 has 2 divisors, whose sum is σ = 32116827135050. Its totient is φ = 32116827135048.
The previous prime is 32116827134999. The next prime is 32116827135059. The reversal of 32116827135049 is 94053172861123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 31858890119424 + 257937015625 = 5644368^2 + 507875^2 .
It is a cyclic number.
It is not a de Polignac number, because 32116827135049 - 27 = 32116827134921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 32116827134987 and 32116827135005.
It is not a weakly prime, because it can be changed into another prime (32116827135059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16058413567524 + 16058413567525.
It is an arithmetic number, because the mean of its divisors is an integer number (16058413567525).
It is a 1-persistent number, because it is pandigital, but 2⋅32116827135049 = 64233654270098 is not.
Almost surely, 232116827135049 is an apocalyptic number.
It is an amenable number.
32116827135049 is a deficient number, since it is larger than the sum of its proper divisors (1).
32116827135049 is an equidigital number, since it uses as much as digits as its factorization.
32116827135049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2177280, while the sum is 52.
The spelling of 32116827135049 in words is "thirty-two trillion, one hundred sixteen billion, eight hundred twenty-seven million, one hundred thirty-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •