Base | Representation |
---|---|
bin | 11000000110110100101111… |
… | …001110100010101010001011 |
3 | 111220101121110122201101000112 |
4 | 120012310233032202222023 |
5 | 102344031134332333031 |
6 | 1013253510105024535 |
7 | 31221561325005326 |
oct | 3006645716425213 |
9 | 456347418641015 |
10 | 106022060042891 |
11 | 308667809a5333 |
12 | ba8395148514b |
13 | 4720ab68bb355 |
14 | 1c276d07317bd |
15 | c3cd2529662b |
hex | 606d2f3a2a8b |
106022060042891 has 4 divisors (see below), whose sum is σ = 106560243088992. Its totient is φ = 105483876996792.
The previous prime is 106022060042881. The next prime is 106022060042911. The reversal of 106022060042891 is 198240060220601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106022060042891 - 214 = 106022060026507 is a prime.
It is a super-2 number, since 2×1060220600428912 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106022060042851) 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 3 ways as a sum of consecutive naturals, for example, 269091522755 + ... + 269091523148.
It is an arithmetic number, because the mean of its divisors is an integer number (26640060772248).
Almost surely, 2106022060042891 is an apocalyptic number.
106022060042891 is a deficient number, since it is larger than the sum of its proper divisors (538183046101).
106022060042891 is an equidigital number, since it uses as much as digits as its factorization.
106022060042891 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 538183046100.
The product of its (nonzero) digits is 82944, while the sum is 41.
The spelling of 106022060042891 in words is "one hundred six trillion, twenty-two billion, sixty million, forty-two thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •