Base | Representation |
---|---|
bin | 1001110010101001011010… |
… | …10001001000111000101101 |
3 | 2211020101101102011121121000 |
4 | 10321110231101020320231 |
5 | 10310232332203204123 |
6 | 113443222545030513 |
7 | 4351410630464400 |
oct | 471245521107055 |
9 | 84211342147530 |
10 | 21531430522413 |
11 | 6951479230089 |
12 | 24b8b28625439 |
13 | c025362698a6 |
14 | 5461abd0bd37 |
15 | 27513672cb43 |
hex | 13952d448e2d |
21531430522413 has 24 divisors (see below), whose sum is σ = 37106320176960. Its totient is φ = 12303674583480.
The previous prime is 21531430522411. The next prime is 21531430522423. The reversal of 21531430522413 is 31422503413512.
21531430522413 is a `hidden beast` number, since 2 + 1 + 5 + 314 + 305 + 2 + 24 + 13 = 666.
It is not a de Polignac number, because 21531430522413 - 21 = 21531430522411 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21531430522411) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8137349593 + ... + 8137352238.
It is an arithmetic number, because the mean of its divisors is an integer number (1546096674040).
Almost surely, 221531430522413 is an apocalyptic number.
It is an amenable number.
21531430522413 is a deficient number, since it is larger than the sum of its proper divisors (15574889654547).
21531430522413 is a wasteful number, since it uses less digits than its factorization.
21531430522413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16274701854 (or 16274701841 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 21531430522413 its reverse (31422503413512), we get a palindrome (52953933935925).
The spelling of 21531430522413 in words is "twenty-one trillion, five hundred thirty-one billion, four hundred thirty million, five hundred twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •