Base | Representation |
---|---|
bin | 10010101110001011… |
… | …000101100110100101 |
3 | 1220212221110222110002 |
4 | 102232023011212211 |
5 | 312132103330201 |
6 | 13122411511045 |
7 | 1311101163641 |
oct | 225613054645 |
9 | 56787428402 |
10 | 20102011301 |
11 | 8586074689 |
12 | 3a90158485 |
13 | 1b84873a58 |
14 | d89a7bc21 |
15 | 7c9bbb76b |
hex | 4ae2c59a5 |
20102011301 has 4 divisors (see below), whose sum is σ = 21284482572. Its totient is φ = 18919540032.
The previous prime is 20102011297. The next prime is 20102011313. The reversal of 20102011301 is 10311020102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 13083928225 + 7018083076 = 114385^2 + 83774^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102011301 - 22 = 20102011297 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102011331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 591235610 + ... + 591235643.
It is an arithmetic number, because the mean of its divisors is an integer number (5321120643).
Almost surely, 220102011301 is an apocalyptic number.
It is an amenable number.
20102011301 is a deficient number, since it is larger than the sum of its proper divisors (1182471271).
20102011301 is a wasteful number, since it uses less digits than its factorization.
20102011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1182471270.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20102011301 its reverse (10311020102), we get a palindrome (30413031403).
The spelling of 20102011301 in words is "twenty billion, one hundred two million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •