Base | Representation |
---|---|
bin | 1001001001001010100111… |
… | …01101001011111010000101 |
3 | 2122012010110220101112211222 |
4 | 10210211103231023322011 |
5 | 10113404341421014012 |
6 | 110432345221010125 |
7 | 4143423022266305 |
oct | 444452355137205 |
9 | 78163426345758 |
10 | 20106146266757 |
11 | 6451a72446341 |
12 | 2308857853945 |
13 | b2b003281ac5 |
14 | 4d71dd6c3605 |
15 | 24d01899b972 |
hex | 124953b4be85 |
20106146266757 has 8 divisors (see below), whose sum is σ = 20683574685696. Its totient is φ = 19530508324752.
The previous prime is 20106146266711. The next prime is 20106146266763. The reversal of 20106146266757 is 75766264160102.
It is a happy number.
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 20106146266757 - 212 = 20106146262661 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20106146266699 and 20106146266708.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20106146266357) 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, 447596453 + ... + 447641370.
It is an arithmetic number, because the mean of its divisors is an integer number (2585446835712).
Almost surely, 220106146266757 is an apocalyptic number.
It is an amenable number.
20106146266757 is a deficient number, since it is larger than the sum of its proper divisors (577428418939).
20106146266757 is an equidigital number, since it uses as much as digits as its factorization.
20106146266757 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 895238467.
The product of its (nonzero) digits is 5080320, while the sum is 53.
The spelling of 20106146266757 in words is "twenty trillion, one hundred six billion, one hundred forty-six million, two hundred sixty-six thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •