Base | Representation |
---|---|
bin | 10100001001101000… |
… | …001000001010111001 |
3 | 2001211212121111100100 |
4 | 110021220020022321 |
5 | 323302401210044 |
6 | 13534542030013 |
7 | 1364111642334 |
oct | 241150101271 |
9 | 61755544310 |
10 | 21636350649 |
11 | 91a3179531 |
12 | 4239b78309 |
13 | 206a6ca164 |
14 | 109375d61b |
15 | 86974a869 |
hex | 509a082b9 |
21636350649 has 9 divisors (see below), whose sum is σ = 31253143909. Its totient is φ = 14423939580.
The previous prime is 21636350641. The next prime is 21636350651. The reversal of 21636350649 is 94605363612.
The square root of 21636350649 is 147093.
It is a perfect power (a square), and thus also a powerful number.
21636350649 is a `hidden beast` number, since 2 + 1 + 6 + 3 + 635 + 0 + 6 + 4 + 9 = 666.
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 21636350649 - 23 = 21636350641 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21636350641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 416764 + ... + 465794.
Almost surely, 221636350649 is an apocalyptic number.
21636350649 is the 147093-rd square number.
21636350649 is the 73547-th centered octagonal number.
It is an amenable number.
21636350649 is a deficient number, since it is larger than the sum of its proper divisors (9616793260).
21636350649 is an frugal number, since it uses more digits than its factorization.
21636350649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98068 (or 49034 counting only the distinct ones).
The product of its (nonzero) digits is 699840, while the sum is 45.
The spelling of 21636350649 in words is "twenty-one billion, six hundred thirty-six million, three hundred fifty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •