Base | Representation |
---|---|
bin | 11101111100101011… |
… | …010001101000000001 |
3 | 10002000001002221212001 |
4 | 131330223101220001 |
5 | 1011324030141431 |
6 | 22434505104001 |
7 | 2215603441261 |
oct | 357453215001 |
9 | 102001087761 |
10 | 32156490241 |
11 | 12701556077 |
12 | 6295188001 |
13 | 30560a1525 |
14 | 17b09db7a1 |
15 | c830ede61 |
hex | 77cad1a01 |
32156490241 has 2 divisors, whose sum is σ = 32156490242. Its totient is φ = 32156490240.
The previous prime is 32156490229. The next prime is 32156490251. The reversal of 32156490241 is 14209465123.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21644294400 + 10512195841 = 147120^2 + 102529^2 .
It is a cyclic number.
It is not a de Polignac number, because 32156490241 - 25 = 32156490209 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 32156490241.
It is not a weakly prime, because it can be changed into another prime (32156490211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 16078245120 + 16078245121.
It is an arithmetic number, because the mean of its divisors is an integer number (16078245121).
Almost surely, 232156490241 is an apocalyptic number.
It is an amenable number.
32156490241 is a deficient number, since it is larger than the sum of its proper divisors (1).
32156490241 is an equidigital number, since it uses as much as digits as its factorization.
32156490241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 32156490241 in words is "thirty-two billion, one hundred fifty-six million, four hundred ninety thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •