Base | Representation |
---|---|
bin | 1011101000101000… |
… | …01001011110000101 |
3 | 121010022201022012011 |
4 | 11310110021132011 |
5 | 100243034443041 |
6 | 2511454054221 |
7 | 310535401162 |
oct | 56424113605 |
9 | 17108638164 |
10 | 6246406021 |
11 | 2715a2a329 |
12 | 1263aaa371 |
13 | 78715064b |
14 | 433831069 |
15 | 2685abe81 |
hex | 174509785 |
6246406021 has 4 divisors (see below), whose sum is σ = 6246588844. Its totient is φ = 6246223200.
The previous prime is 6246406007. The next prime is 6246406037. The reversal of 6246406021 is 1206046426.
6246406021 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3162825121 + 3083580900 = 56239^2 + 55530^2 .
It is a cyclic number.
It is not a de Polignac number, because 6246406021 - 221 = 6244308869 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 (6246406091) 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, 23190 + ... + 114151.
It is an arithmetic number, because the mean of its divisors is an integer number (1561647211).
Almost surely, 26246406021 is an apocalyptic number.
It is an amenable number.
6246406021 is a deficient number, since it is larger than the sum of its proper divisors (182823).
6246406021 is a wasteful number, since it uses less digits than its factorization.
6246406021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182822.
The product of its (nonzero) digits is 13824, while the sum is 31.
The square root of 6246406021 is about 79034.2079165724. The cubic root of 6246406021 is about 1841.6626061057.
The spelling of 6246406021 in words is "six billion, two hundred forty-six million, four hundred six thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •