Base | Representation |
---|---|
bin | 10010101110000111… |
… | …110100101010110011 |
3 | 1220212212212111112000 |
4 | 102232013310222303 |
5 | 312131343434012 |
6 | 13122341305043 |
7 | 1311061000626 |
oct | 225607645263 |
9 | 56785774460 |
10 | 20101155507 |
11 | 858563a714 |
12 | 3a8ba05183 |
13 | 1b84634374 |
14 | d898d7dbd |
15 | 7c9a9cddc |
hex | 4ae1f4ab3 |
20101155507 has 32 divisors (see below), whose sum is σ = 31373644800. Its totient is φ = 12684607776.
The previous prime is 20101155499. The next prime is 20101155517. The reversal of 20101155507 is 70555110102.
20101155507 is a `hidden beast` number, since 2 + 0 + 1 + 0 + 1 + 155 + 507 = 666.
It is not a de Polignac number, because 20101155507 - 23 = 20101155499 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (20101155517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 606118 + ... + 638420.
It is an arithmetic number, because the mean of its divisors is an integer number (980426400).
Almost surely, 220101155507 is an apocalyptic number.
20101155507 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
20101155507 is a deficient number, since it is larger than the sum of its proper divisors (11272489293).
20101155507 is a wasteful number, since it uses less digits than its factorization.
20101155507 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33544 (or 33538 counting only the distinct ones).
The product of its (nonzero) digits is 1750, while the sum is 27.
Adding to 20101155507 its reverse (70555110102), we get a palindrome (90656265609).
The spelling of 20101155507 in words is "twenty billion, one hundred one million, one hundred fifty-five thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •