Base | Representation |
---|---|
bin | 1001100111111101011010… |
… | …10101101111110011101111 |
3 | 2202221021112022210012102011 |
4 | 10303332231111233303233 |
5 | 10233223301234322412 |
6 | 113002412122142051 |
7 | 4313030621665036 |
oct | 463765525576357 |
9 | 82837468705364 |
10 | 21164212026607 |
11 | 681a767a37011 |
12 | 2459923951927 |
13 | ba6a13346010 |
14 | 5324d376171d |
15 | 26a7e2c427a7 |
hex | 133fad56fcef |
21164212026607 has 8 divisors (see below), whose sum is σ = 23222270381184. Its totient is φ = 19167588249888.
The previous prime is 21164212026541. The next prime is 21164212026647. The reversal of 21164212026607 is 70662021246112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21164212026607 - 223 = 21164203637999 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 21164212026607.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21164212026647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15358643743 + ... + 15358645120.
It is an arithmetic number, because the mean of its divisors is an integer number (2902783797648).
Almost surely, 221164212026607 is an apocalyptic number.
21164212026607 is a deficient number, since it is larger than the sum of its proper divisors (2058058354577).
21164212026607 is a wasteful number, since it uses less digits than its factorization.
21164212026607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30717288929.
The product of its (nonzero) digits is 96768, while the sum is 40.
The spelling of 21164212026607 in words is "twenty-one trillion, one hundred sixty-four billion, two hundred twelve million, twenty-six thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •