Base | Representation |
---|---|
bin | 1011100011100100… |
… | …11011101101010101 |
3 | 121000100221112102222 |
4 | 11301302123231111 |
5 | 100201211412042 |
6 | 2503341312125 |
7 | 306512146421 |
oct | 56162335525 |
9 | 17010845388 |
10 | 6204013397 |
11 | 26a40050aa |
12 | 1251865645 |
13 | 77b429a5a |
14 | 42bd57b81 |
15 | 2649d62d2 |
hex | 171c9bb55 |
6204013397 has 4 divisors (see below), whose sum is σ = 6267972396. Its totient is φ = 6140054400.
The previous prime is 6204013391. The next prime is 6204013423. The reversal of 6204013397 is 7933104026.
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 3829010641 + 2375002756 = 61879^2 + 48734^2 .
It is a cyclic number.
It is not a de Polignac number, because 6204013397 - 24 = 6204013381 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 (6204013391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 31979354 + ... + 31979547.
It is an arithmetic number, because the mean of its divisors is an integer number (1566993099).
Almost surely, 26204013397 is an apocalyptic number.
It is an amenable number.
6204013397 is a deficient number, since it is larger than the sum of its proper divisors (63958999).
6204013397 is an equidigital number, since it uses as much as digits as its factorization.
6204013397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63958998.
The product of its (nonzero) digits is 27216, while the sum is 35.
The square root of 6204013397 is about 78765.5597136210. The cubic root of 6204013397 is about 1837.4868609485.
The spelling of 6204013397 in words is "six billion, two hundred four million, thirteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •