Base | Representation |
---|---|
bin | 1001001010000000011010… |
… | …01010111010000001011100 |
3 | 2122021220000200210122210021 |
4 | 10211000031022322001130 |
5 | 10114343014034142211 |
6 | 110453523133121524 |
7 | 4145464520050624 |
oct | 445001512720134 |
9 | 78256020718707 |
10 | 20135027646556 |
11 | 6463243207469 |
12 | 23123780292a4 |
13 | b30956976b54 |
14 | 4d877d343884 |
15 | 24db592b2771 |
hex | 12500d2ba05c |
20135027646556 has 12 divisors (see below), whose sum is σ = 35489796931960. Its totient is φ = 9995085666000.
The previous prime is 20135027646551. The next prime is 20135027646557. The reversal of 20135027646556 is 65564672053102.
It is a super-2 number, since 2×201350276465562 (a number of 27 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (52) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20135027646551) 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 3 ways as a sum of consecutive naturals, for example, 18107038695 + ... + 18107039806.
Almost surely, 220135027646556 is an apocalyptic number.
It is an amenable number.
20135027646556 is a deficient number, since it is larger than the sum of its proper divisors (15354769285404).
20135027646556 is a wasteful number, since it uses less digits than its factorization.
20135027646556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36214078644 (or 36214078642 counting only the distinct ones).
The product of its (nonzero) digits is 9072000, while the sum is 52.
Adding to 20135027646556 its reverse (65564672053102), we get a palindrome (85699699699658).
The spelling of 20135027646556 in words is "twenty trillion, one hundred thirty-five billion, twenty-seven million, six hundred forty-six thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •