Base | Representation |
---|---|
bin | 10010110001001011… |
… | …101100101100111101 |
3 | 1221000110111020011202 |
4 | 102301023230230331 |
5 | 312233020044401 |
6 | 13131414025245 |
7 | 1312253310233 |
oct | 226113545475 |
9 | 57013436152 |
10 | 20152503101 |
11 | 8601620945 |
12 | 3aa5048225 |
13 | 1b92171c63 |
14 | d92662953 |
15 | 7ce34206b |
hex | 4b12ecb3d |
20152503101 has 12 divisors (see below), whose sum is σ = 21074164188. Its totient is φ = 19269564864.
The previous prime is 20152503089. The next prime is 20152503149. The reversal of 20152503101 is 10130525102.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 371487076 + 19781016025 = 19274^2 + 140645^2 .
It is not a de Polignac number, because 20152503101 - 222 = 20148308797 is a prime.
It is a super-2 number, since 2×201525031012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20152553101) 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, 2192351 + ... + 2201523.
It is an arithmetic number, because the mean of its divisors is an integer number (1756180349).
Almost surely, 220152503101 is an apocalyptic number.
It is an amenable number.
20152503101 is a deficient number, since it is larger than the sum of its proper divisors (921661087).
20152503101 is an equidigital number, since it uses as much as digits as its factorization.
20152503101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13372 (or 13349 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 20.
The spelling of 20152503101 in words is "twenty billion, one hundred fifty-two million, five hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •