Base | Representation |
---|---|
bin | 10011100111011110… |
… | …001010000000000001 |
3 | 2000100221100002020000 |
4 | 103213132022000001 |
5 | 321114201430421 |
6 | 13402031510213 |
7 | 1343653123011 |
oct | 234736120001 |
9 | 60327302200 |
10 | 21063311361 |
11 | 8a29765644 |
12 | 40ba088369 |
13 | 1ca8a81061 |
14 | 103b5d3c41 |
15 | 8342a6226 |
hex | 4e778a001 |
21063311361 has 20 divisors (see below), whose sum is σ = 31543461444. Its totient is φ = 14007168000.
The previous prime is 21063311359. The next prime is 21063311363. The reversal of 21063311361 is 16311336012.
21063311361 is a `hidden beast` number, since 2 + 10 + 633 + 1 + 13 + 6 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (21063311359) and next prime (21063311363).
It can be written as a sum of positive squares in 2 ways, for example, as 14231297025 + 6832014336 = 119295^2 + 82656^2 .
It is not a de Polignac number, because 21063311361 - 21 = 21063311359 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (21063311363) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 291760 + ... + 356721.
Almost surely, 221063311361 is an apocalyptic number.
It is an amenable number.
21063311361 is a deficient number, since it is larger than the sum of its proper divisors (10480150083).
21063311361 is an equidigital number, since it uses as much as digits as its factorization.
21063311361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 648894 (or 648885 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
Adding to 21063311361 its reverse (16311336012), we get a palindrome (37374647373).
The spelling of 21063311361 in words is "twenty-one billion, sixty-three million, three hundred eleven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •