Base | Representation |
---|---|
bin | 1001100100111101001101… |
… | …11111111110101110101001 |
3 | 2202120102012010220101211001 |
4 | 10302132212333332232221 |
5 | 10230030440232122103 |
6 | 112443145121035001 |
7 | 4302415603666225 |
oct | 462364677765651 |
9 | 82512163811731 |
10 | 21061026442153 |
11 | 678aa27404195 |
12 | 2441927185a61 |
13 | b9a07a874379 |
14 | 52b5055c9785 |
15 | 267ca400601d |
hex | 1327a6ffeba9 |
21061026442153 has 32 divisors (see below), whose sum is σ = 22080072453120. Its totient is φ = 20068403754240.
The previous prime is 21061026442133. The next prime is 21061026442189. The reversal of 21061026442153 is 35124462016012.
It is a cyclic number.
It is not a de Polignac number, because 21061026442153 - 241 = 18862003186601 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21061026442133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 766203976 + ... + 766231462.
It is an arithmetic number, because the mean of its divisors is an integer number (690002264160).
Almost surely, 221061026442153 is an apocalyptic number.
It is an amenable number.
21061026442153 is a deficient number, since it is larger than the sum of its proper divisors (1019046010967).
21061026442153 is a wasteful number, since it uses less digits than its factorization.
21061026442153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28897.
The product of its (nonzero) digits is 69120, while the sum is 37.
Adding to 21061026442153 its reverse (35124462016012), we get a palindrome (56185488458165).
The spelling of 21061026442153 in words is "twenty-one trillion, sixty-one billion, twenty-six million, four hundred forty-two thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •