Base | Representation |
---|---|
bin | 1001001010010101001010… |
… | …01001001001010000100101 |
3 | 2122022221210000221110022120 |
4 | 10211022211021021100211 |
5 | 10120033322304143401 |
6 | 110503004345420153 |
7 | 4146340543136445 |
oct | 445124511112045 |
9 | 78287700843276 |
10 | 20146167256101 |
11 | 6467a3a22aa47 |
12 | 231456679a659 |
13 | b31a107a2ba3 |
14 | 4d9118996125 |
15 | 24e0ac22c836 |
hex | 1252a5249425 |
20146167256101 has 8 divisors (see below), whose sum is σ = 26861578673760. Its totient is φ = 13430767004592.
The previous prime is 20146167256051. The next prime is 20146167256123. The reversal of 20146167256101 is 10165276164102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20146167256101 - 213 = 20146167247909 is a prime.
It is a super-2 number, since 2×201461672561012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20146167256181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3346110 + ... + 7175568.
It is an arithmetic number, because the mean of its divisors is an integer number (3357697334220).
Almost surely, 220146167256101 is an apocalyptic number.
It is an amenable number.
20146167256101 is a deficient number, since it is larger than the sum of its proper divisors (6715411417659).
20146167256101 is a wasteful number, since it uses less digits than its factorization.
20146167256101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5583075.
The product of its (nonzero) digits is 120960, while the sum is 42.
The spelling of 20146167256101 in words is "twenty trillion, one hundred forty-six billion, one hundred sixty-seven million, two hundred fifty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •