Base | Representation |
---|---|
bin | 10010101111010000… |
… | …010011001111011101 |
3 | 1220221012121210001200 |
4 | 102233100103033131 |
5 | 312201224430401 |
6 | 13124300430113 |
7 | 1311411332214 |
oct | 225720231735 |
9 | 56835553050 |
10 | 20120155101 |
11 | 8595337362 |
12 | 3a96248339 |
13 | 1b88557327 |
14 | d8c24207b |
15 | 7cb5a2686 |
hex | 4af4133dd |
20120155101 has 12 divisors (see below), whose sum is σ = 29187180828. Its totient is φ = 13355866944.
The previous prime is 20120155067. The next prime is 20120155109. The reversal of 20120155101 is 10155102102.
20120155101 is a `hidden beast` number, since 20 + 120 + 15 + 510 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1581971076 + 18538184025 = 39774^2 + 136155^2 .
It is not a de Polignac number, because 20120155101 - 213 = 20120146909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20120155109) 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 11 ways as a sum of consecutive naturals, for example, 4795270 + ... + 4799463.
It is an arithmetic number, because the mean of its divisors is an integer number (2432265069).
Almost surely, 220120155101 is an apocalyptic number.
It is an amenable number.
20120155101 is a deficient number, since it is larger than the sum of its proper divisors (9067025727).
20120155101 is a wasteful number, since it uses less digits than its factorization.
20120155101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9594972 (or 9594969 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 18.
Adding to 20120155101 its reverse (10155102102), we get a palindrome (30275257203).
The spelling of 20120155101 in words is "twenty billion, one hundred twenty million, one hundred fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •