Base | Representation |
---|---|
bin | 1001001010000001010101… |
… | …10010010010101001011101 |
3 | 2122021221022022201221201012 |
4 | 10211000222302102221131 |
5 | 10114400023233312201 |
6 | 110454044322425005 |
7 | 4145513032243154 |
oct | 445005262225135 |
9 | 78257268657635 |
10 | 20135524510301 |
11 | 6463478721562 |
12 | 2312496502165 |
13 | b30a058a1575 |
14 | 4d87c932059b |
15 | 24db87c0b5bb |
hex | 12502ac92a5d |
20135524510301 has 16 divisors (see below), whose sum is σ = 21579693335424. Its totient is φ = 18720274665984.
The previous prime is 20135524510273. The next prime is 20135524510307. The reversal of 20135524510301 is 10301542553102.
It is a cyclic number.
It is not a de Polignac number, because 20135524510301 - 218 = 20135524248157 is a prime.
It is a super-2 number, since 2×201355245103012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20135524510307) 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 15 ways as a sum of consecutive naturals, for example, 9749456 + ... + 11632838.
It is an arithmetic number, because the mean of its divisors is an integer number (1348730833464).
Almost surely, 220135524510301 is an apocalyptic number.
It is an amenable number.
20135524510301 is a deficient number, since it is larger than the sum of its proper divisors (1444168825123).
20135524510301 is a wasteful number, since it uses less digits than its factorization.
20135524510301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1891060.
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 20135524510301 in words is "twenty trillion, one hundred thirty-five billion, five hundred twenty-four million, five hundred ten thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •