Base | Representation |
---|---|
bin | 1011111100001001… |
… | …0001110010101101 |
3 | 22021100212011202222 |
4 | 2333002101302231 |
5 | 23030442423141 |
6 | 1250011125125 |
7 | 142265302514 |
oct | 27702216255 |
9 | 8240764688 |
10 | 3205045421 |
11 | 13a518a076 |
12 | 7554437a5 |
13 | 3c10171a6 |
14 | 22593d67b |
15 | 13b59814b |
hex | bf091cad |
3205045421 has 4 divisors (see below), whose sum is σ = 3205511772. Its totient is φ = 3204579072.
The previous prime is 3205045379. The next prime is 3205045447. The reversal of 3205045421 is 1245405023.
It is a happy number.
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 612810025 + 2592235396 = 24755^2 + 50914^2 .
It is a cyclic number.
It is not a de Polignac number, because 3205045421 - 230 = 2131303597 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 (3205045471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 222710 + ... + 236663.
It is an arithmetic number, because the mean of its divisors is an integer number (801377943).
Almost surely, 23205045421 is an apocalyptic number.
It is an amenable number.
3205045421 is a deficient number, since it is larger than the sum of its proper divisors (466351).
3205045421 is an equidigital number, since it uses as much as digits as its factorization.
3205045421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466350.
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 3205045421 is about 56613.1205728849. The cubic root of 3205045421 is about 1474.3866715190.
The spelling of 3205045421 in words is "three billion, two hundred five million, forty-five thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •