Base | Representation |
---|---|
bin | 1001110010101001010111… |
… | …01101010001000100101111 |
3 | 2211020101022120220111012110 |
4 | 10321110223231101010233 |
5 | 10310232304002412201 |
6 | 113443220211535103 |
7 | 4351410162113346 |
oct | 471245355210457 |
9 | 84211276814173 |
10 | 21531404341551 |
11 | 6951465479005 |
12 | 24b8b1b8ba493 |
13 | c02530a01060 |
14 | 5461a8654b5d |
15 | 2751342aa6d6 |
hex | 13952bb5112f |
21531404341551 has 16 divisors (see below), whose sum is σ = 30965884974080. Its totient is φ = 13229096398560.
The previous prime is 21531404341511. The next prime is 21531404341561. The reversal of 21531404341551 is 15514340413512.
It is not a de Polignac number, because 21531404341551 - 213 = 21531404333359 is a prime.
It is a super-2 number, since 2×215314043415512 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21531404341511) 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 15 ways as a sum of consecutive naturals, for example, 437445511 + ... + 437494728.
It is an arithmetic number, because the mean of its divisors is an integer number (1935367810880).
Almost surely, 221531404341551 is an apocalyptic number.
21531404341551 is a deficient number, since it is larger than the sum of its proper divisors (9434480632529).
21531404341551 is a wasteful number, since it uses less digits than its factorization.
21531404341551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874940886.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 21531404341551 in words is "twenty-one trillion, five hundred thirty-one billion, four hundred four million, three hundred forty-one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •