Base | Representation |
---|---|
bin | 1001100100000101010110… |
… | …10000001100010101110001 |
3 | 2202110112202212000012021022 |
4 | 10302002223100030111301 |
5 | 10224033023423430001 |
6 | 112421305002105225 |
7 | 4300304414126021 |
oct | 462025320142561 |
9 | 82415685005238 |
10 | 21031033030001 |
11 | 677923595a765 |
12 | 2437b564ab215 |
13 | b972aa977a07 |
14 | 529c9bdb7a81 |
15 | 2670eac7e11b |
hex | 1320ab40c571 |
21031033030001 has 4 divisors (see below), whose sum is σ = 21140002113252. Its totient is φ = 20922063946752.
The previous prime is 21031033029971. The next prime is 21031033030057. The reversal of 21031033030001 is 10003033013012.
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 3844834680625 + 17186198349376 = 1960825^2 + 4145624^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21031033030001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21031033030061) 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, 54484541336 + ... + 54484541721.
It is an arithmetic number, because the mean of its divisors is an integer number (5285000528313).
Almost surely, 221031033030001 is an apocalyptic number.
It is an amenable number.
21031033030001 is a deficient number, since it is larger than the sum of its proper divisors (108969083251).
21031033030001 is a wasteful number, since it uses less digits than its factorization.
21031033030001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 108969083250.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 21031033030001 its reverse (10003033013012), we get a palindrome (31034066043013).
The spelling of 21031033030001 in words is "twenty-one trillion, thirty-one billion, thirty-three million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •