Base | Representation |
---|---|
bin | 1001110010101000111111… |
… | …10011000001010110010011 |
3 | 2211020100210122220200020121 |
4 | 10321110133303001112103 |
5 | 10310231401324222121 |
6 | 113443144313051111 |
7 | 4351402214514232 |
oct | 471243763012623 |
9 | 84210718820217 |
10 | 21531204523411 |
11 | 69513726aa750 |
12 | 24b8a849b6a97 |
13 | c024cb4ab77b |
14 | 546189cbcb19 |
15 | 27512198a141 |
hex | 13951fcc1593 |
21531204523411 has 8 divisors (see below), whose sum is σ = 23490091943424. Its totient is φ = 19572567968520.
The previous prime is 21531204523267. The next prime is 21531204523417. The reversal of 21531204523411 is 11432540213512.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21531204523411 - 215 = 21531204490643 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21531204523417) 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 in 7 ways as a sum of consecutive naturals, for example, 62536795 + ... + 62880148.
It is an arithmetic number, because the mean of its divisors is an integer number (2936261492928).
Almost surely, 221531204523411 is an apocalyptic number.
21531204523411 is a deficient number, since it is larger than the sum of its proper divisors (1958887420013).
21531204523411 is a wasteful number, since it uses less digits than its factorization.
21531204523411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 125432561.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 21531204523411 its reverse (11432540213512), we get a palindrome (32963744736923).
The spelling of 21531204523411 in words is "twenty-one trillion, five hundred thirty-one billion, two hundred four million, five hundred twenty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •