Base | Representation |
---|---|
bin | 1011111011101011… |
… | …01110101101100101 |
3 | 121112110101220011111 |
4 | 11331311232231211 |
5 | 101104442014021 |
6 | 2535403105021 |
7 | 314515560232 |
oct | 57565565545 |
9 | 17473356144 |
10 | 6406204261 |
11 | 2798154096 |
12 | 12a9512171 |
13 | 7b12a0312 |
14 | 44ab4a789 |
15 | 2776248e1 |
hex | 17dd6eb65 |
6406204261 has 8 divisors (see below), whose sum is σ = 6421565304. Its totient is φ = 6390863040.
The previous prime is 6406204253. The next prime is 6406204289. The reversal of 6406204261 is 1624026046.
It can be written as a sum of positive squares in 4 ways, for example, as 996601761 + 5409602500 = 31569^2 + 73550^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 6406204261 - 23 = 6406204253 is a prime.
It is a super-2 number, since 2×64062042612 = 82078906067309112242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6406204291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 785175 + ... + 793291.
It is an arithmetic number, because the mean of its divisors is an integer number (802695663).
Almost surely, 26406204261 is an apocalyptic number.
It is an amenable number.
6406204261 is a deficient number, since it is larger than the sum of its proper divisors (15361043).
6406204261 is a wasteful number, since it uses less digits than its factorization.
6406204261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9911.
The product of its (nonzero) digits is 13824, while the sum is 31.
The square root of 6406204261 is about 80038.7672381328. The cubic root of 6406204261 is about 1857.2352902776.
The spelling of 6406204261 in words is "six billion, four hundred six million, two hundred four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •