Base | Representation |
---|---|
bin | 1101000011110011… |
… | …01011101000110101 |
3 | 200002121211212202121 |
4 | 12201321223220311 |
5 | 103324333020041 |
6 | 3115414435541 |
7 | 335513246461 |
oct | 64171535065 |
9 | 20077755677 |
10 | 7011220021 |
11 | 2a78718413 |
12 | 1438062bb1 |
13 | 879733c00 |
14 | 4a723b4a1 |
15 | 2b07d37d1 |
hex | 1a1e6ba35 |
7011220021 has 12 divisors (see below), whose sum is σ = 7797228132. Its totient is φ = 6296973696.
The previous prime is 7011219979. The next prime is 7011220037. The reversal of 7011220021 is 1200221107.
It can be written as a sum of positive squares in 6 ways, for example, as 3186225 + 7008033796 = 1785^2 + 83714^2 .
It is a de Polignac number, because none of the positive numbers 2k-7011220021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 7011219977 and 7011220004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7011220421) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 554376 + ... + 566881.
It is an arithmetic number, because the mean of its divisors is an integer number (649769011).
Almost surely, 27011220021 is an apocalyptic number.
It is an amenable number.
7011220021 is a deficient number, since it is larger than the sum of its proper divisors (786008111).
7011220021 is a wasteful number, since it uses less digits than its factorization.
7011220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1121320 (or 1121307 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 16.
The square root of 7011220021 is about 83733.0282564771. The cubic root of 7011220021 is about 1913.9526909047.
Adding to 7011220021 its reverse (1200221107), we get a palindrome (8211441128).
The spelling of 7011220021 in words is "seven billion, eleven million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •