Base | Representation |
---|---|
bin | 10010101111100011… |
… | …100101101010100101 |
3 | 1220221120010122212100 |
4 | 102233203211222211 |
5 | 312204023230201 |
6 | 13125001042313 |
7 | 1311502321266 |
oct | 225743455245 |
9 | 56846118770 |
10 | 20125211301 |
11 | 8598180138 |
12 | 3a97a86399 |
13 | 1b89607870 |
14 | d8cb9a96d |
15 | 7cbc50886 |
hex | 4af8e5aa5 |
20125211301 has 48 divisors (see below), whose sum is σ = 32833696896. Its totient is φ = 11785834368.
The previous prime is 20125211297. The next prime is 20125211321. The reversal of 20125211301 is 10311252102.
20125211301 is a `hidden beast` number, since 2 + 0 + 12 + 521 + 130 + 1 = 666.
It is not a de Polignac number, because 20125211301 - 22 = 20125211297 is a prime.
It is a super-2 number, since 2×201252113012 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20125211321) 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 47 ways as a sum of consecutive naturals, for example, 511146 + ... + 549108.
It is an arithmetic number, because the mean of its divisors is an integer number (684035352).
Almost surely, 220125211301 is an apocalyptic number.
It is an amenable number.
20125211301 is a deficient number, since it is larger than the sum of its proper divisors (12708485595).
20125211301 is a wasteful number, since it uses less digits than its factorization.
20125211301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38202 (or 38199 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
Adding to 20125211301 its reverse (10311252102), we get a palindrome (30436463403).
The spelling of 20125211301 in words is "twenty billion, one hundred twenty-five million, two hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •