Base | Representation |
---|---|
bin | 1011111000000000110… |
… | …1001101111000111001 |
3 | 201111121010002220120012 |
4 | 2332000031031320321 |
5 | 11320310142130241 |
6 | 233420052511305 |
7 | 20511444612050 |
oct | 2760015157071 |
9 | 644533086505 |
10 | 204014411321 |
11 | 795818a8906 |
12 | 3365801b535 |
13 | 16313c182a6 |
14 | 9c35307397 |
15 | 5490ae46eb |
hex | 2f8034de39 |
204014411321 has 8 divisors (see below), whose sum is σ = 233164799040. Its totient is φ = 174865391568.
The previous prime is 204014411309. The next prime is 204014411351. The reversal of 204014411321 is 123114410402.
204014411321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 204014411321 - 234 = 186834542137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204014411351) 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 7 ways as a sum of consecutive naturals, for example, 455 + ... + 638771.
It is an arithmetic number, because the mean of its divisors is an integer number (29145599880).
Almost surely, 2204014411321 is an apocalyptic number.
It is an amenable number.
204014411321 is a deficient number, since it is larger than the sum of its proper divisors (29150387719).
204014411321 is an equidigital number, since it uses as much as digits as its factorization.
204014411321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683983.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 204014411321 its reverse (123114410402), we get a palindrome (327128821723).
The spelling of 204014411321 in words is "two hundred four billion, fourteen million, four hundred eleven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.949 sec. • engine limits •