Base | Representation |
---|---|
bin | 1001100110010010001000… |
… | …00111101010001011111111 |
3 | 2202201202212002110100102102 |
4 | 10303021010013222023333 |
5 | 10231302320202313124 |
6 | 112520124353015315 |
7 | 4305621345062462 |
oct | 463110407521377 |
9 | 82652762410372 |
10 | 21106612151039 |
11 | 67a829a346a68 |
12 | 244a72985453b |
13 | ba1463c192cc |
14 | 52d7cb9612d9 |
15 | 26907108caae |
hex | 1332441ea2ff |
21106612151039 has 8 divisors (see below), whose sum is σ = 21597552273792. Its totient is φ = 20615676059160.
The previous prime is 21106612150913. The next prime is 21106612151143. The reversal of 21106612151039 is 93015121660112.
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 21106612151039 - 224 = 21106595373823 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21106612150993 and 21106612151011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21106612151939) 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, 11320334 + ... + 13052324.
It is an arithmetic number, because the mean of its divisors is an integer number (2699694034224).
Almost surely, 221106612151039 is an apocalyptic number.
21106612151039 is a deficient number, since it is larger than the sum of its proper divisors (490940122753).
21106612151039 is a wasteful number, since it uses less digits than its factorization.
21106612151039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2015437.
The product of its (nonzero) digits is 19440, while the sum is 38.
The spelling of 21106612151039 in words is "twenty-one trillion, one hundred six billion, six hundred twelve million, one hundred fifty-one thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •