Base | Representation |
---|---|
bin | 1001100111000011100100… |
… | …01010011011011111110011 |
3 | 2202211022100212102222100212 |
4 | 10303201302022123133303 |
5 | 10232221200013324021 |
6 | 112540234230134335 |
7 | 4310551160542655 |
oct | 463416212333763 |
9 | 82738325388325 |
10 | 21133154433011 |
11 | 680857a812295 |
12 | 24538b67b13ab |
13 | ba3b03b2a1ba |
14 | 530bc8a966d5 |
15 | 269ac635c85b |
hex | 13387229b7f3 |
21133154433011 has 8 divisors (see below), whose sum is σ = 21533396858784. Its totient is φ = 20732967698560.
The previous prime is 21133154432989. The next prime is 21133154433019. The reversal of 21133154433011 is 11033445133112.
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-21133154433011 is a prime.
It is a super-2 number, since 2×211331544330112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21133154433019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13156310 + ... + 14674971.
It is an arithmetic number, because the mean of its divisors is an integer number (2691674607348).
Almost surely, 221133154433011 is an apocalyptic number.
21133154433011 is a deficient number, since it is larger than the sum of its proper divisors (400242425773).
21133154433011 is a wasteful number, since it uses less digits than its factorization.
21133154433011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27845661.
The product of its (nonzero) digits is 12960, while the sum is 32.
Adding to 21133154433011 its reverse (11033445133112), we get a palindrome (32166599566123).
The spelling of 21133154433011 in words is "twenty-one trillion, one hundred thirty-three billion, one hundred fifty-four million, four hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •