Base | Representation |
---|---|
bin | 101011111100100110101… |
… | …100111101111000011101 |
3 | 101200201011210010020001021 |
4 | 223330212230331320131 |
5 | 343434440400043401 |
6 | 10231212443444141 |
7 | 431121460523212 |
oct | 53744654757035 |
9 | 11621153106037 |
10 | 3020011331101 |
11 | a64863734a46 |
12 | 40936b826651 |
13 | 18ba2a67421b |
14 | a62528cbb09 |
15 | 5385649c2a1 |
hex | 2bf26b3de1d |
3020011331101 has 4 divisors (see below), whose sum is σ = 3026619671452. Its totient is φ = 3013402990752.
The previous prime is 3020011331093. The next prime is 3020011331111. The reversal of 3020011331101 is 1011331100203.
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 2674942025625 + 345069305476 = 1635525^2 + 587426^2 .
It is a cyclic number.
It is not a de Polignac number, because 3020011331101 - 23 = 3020011331093 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 (3020011331111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3304169490 + ... + 3304170403.
It is an arithmetic number, because the mean of its divisors is an integer number (756654917863).
Almost surely, 23020011331101 is an apocalyptic number.
It is an amenable number.
3020011331101 is a deficient number, since it is larger than the sum of its proper divisors (6608340351).
3020011331101 is an equidigital number, since it uses as much as digits as its factorization.
3020011331101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6608340350.
The product of its (nonzero) digits is 54, while the sum is 16.
Adding to 3020011331101 its reverse (1011331100203), we get a palindrome (4031342431304).
The spelling of 3020011331101 in words is "three trillion, twenty billion, eleven million, three hundred thirty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •