Base | Representation |
---|---|
bin | 10011101100101001… |
… | …110001111001000111 |
3 | 2000120222220201222001 |
4 | 103230221301321013 |
5 | 321303430310143 |
6 | 13414415050131 |
7 | 1346060053120 |
oct | 235451617107 |
9 | 60528821861 |
10 | 21150244423 |
11 | 8a73841750 |
12 | 4123210947 |
13 | 1cc0a9b039 |
14 | 1048d83047 |
15 | 83bc2914d |
hex | 4eca71e47 |
21150244423 has 8 divisors (see below), whose sum is σ = 26369136000. Its totient is φ = 16480709880.
The previous prime is 21150244403. The next prime is 21150244433. The reversal of 21150244423 is 32444205112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21150244423 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21150244391 and 21150244400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21150244403) 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 in 7 ways as a sum of consecutive naturals, for example, 137339173 + ... + 137339326.
It is an arithmetic number, because the mean of its divisors is an integer number (3296142000).
Almost surely, 221150244423 is an apocalyptic number.
21150244423 is a deficient number, since it is larger than the sum of its proper divisors (5218891577).
21150244423 is a wasteful number, since it uses less digits than its factorization.
21150244423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274678517.
The product of its (nonzero) digits is 7680, while the sum is 28.
Adding to 21150244423 its reverse (32444205112), we get a palindrome (53594449535).
The spelling of 21150244423 in words is "twenty-one billion, one hundred fifty million, two hundred forty-four thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •