Base | Representation |
---|---|
bin | 1001100111100011000000… |
… | …10101010001001011100001 |
3 | 2202212220221022111102201202 |
4 | 10303301200111101023201 |
5 | 10233010232444404013 |
6 | 112552105250410545 |
7 | 4312016405363621 |
oct | 463614025211341 |
9 | 82786838442652 |
10 | 21150035153633 |
11 | 6814752511571 |
12 | 2457027b90a55 |
13 | ba55941b9699 |
14 | 53194a9a6881 |
15 | 26a263322858 |
hex | 133c605512e1 |
21150035153633 has 2 divisors, whose sum is σ = 21150035153634. Its totient is φ = 21150035153632.
The previous prime is 21150035153587. The next prime is 21150035153719. The reversal of 21150035153633 is 33635153005112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13731123035809 + 7418912117824 = 3705553^2 + 2723768^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21150035153633 is a prime.
It is not a weakly prime, because it can be changed into another prime (21150035156633) 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, 10575017576816 + 10575017576817.
It is an arithmetic number, because the mean of its divisors is an integer number (10575017576817).
Almost surely, 221150035153633 is an apocalyptic number.
It is an amenable number.
21150035153633 is a deficient number, since it is larger than the sum of its proper divisors (1).
21150035153633 is an equidigital number, since it uses as much as digits as its factorization.
21150035153633 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 121500, while the sum is 38.
Adding to 21150035153633 its reverse (33635153005112), we get a palindrome (54785188158745).
The spelling of 21150035153633 in words is "twenty-one trillion, one hundred fifty billion, thirty-five million, one hundred fifty-three thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.344 sec. • engine limits •