Base | Representation |
---|---|
bin | 1001110101100101110010… |
… | …01111000110001100000111 |
3 | 2211121001102111212001221102 |
4 | 10322302321033012030013 |
5 | 10313411442114421002 |
6 | 114001510130010315 |
7 | 4361621035652366 |
oct | 472627117061407 |
9 | 84531374761842 |
10 | 21632563045127 |
11 | 6990355974271 |
12 | 251465171699b |
13 | c0bc325a62c8 |
14 | 54b0435357dd |
15 | 277aa50c4a02 |
hex | 13acb93c6307 |
21632563045127 has 2 divisors, whose sum is σ = 21632563045128. Its totient is φ = 21632563045126.
The previous prime is 21632563045097. The next prime is 21632563045169. The reversal of 21632563045127 is 72154036523612.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 21632563045127 - 28 = 21632563044871 is a prime.
It is a super-2 number, since 2×216325630451272 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21632563045727) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10816281522563 + 10816281522564.
It is an arithmetic number, because the mean of its divisors is an integer number (10816281522564).
Almost surely, 221632563045127 is an apocalyptic number.
21632563045127 is a deficient number, since it is larger than the sum of its proper divisors (1).
21632563045127 is an equidigital number, since it uses as much as digits as its factorization.
21632563045127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1814400, while the sum is 47.
Adding to 21632563045127 its reverse (72154036523612), we get a palindrome (93786599568739).
The spelling of 21632563045127 in words is "twenty-one trillion, six hundred thirty-two billion, five hundred sixty-three million, forty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •