Base | Representation |
---|---|
bin | 101110011111000011010100… |
… | …100111001001000010000001 |
3 | 222210212122201121002000211021 |
4 | 232133003110213021002001 |
5 | 203244102313120220001 |
6 | 2002452140505345441 |
7 | 61030410106630534 |
oct | 5637032447110201 |
9 | 883778647060737 |
10 | 204444010320001 |
11 | 5a162243a88101 |
12 | 1ab1a751498281 |
13 | 8a0ccab570cca |
14 | 386b200172a1b |
15 | 18980d053cba1 |
hex | b9f0d49c9081 |
204444010320001 has 4 divisors (see below), whose sum is σ = 209198522187952. Its totient is φ = 199689498452052.
The previous prime is 204444010319957. The next prime is 204444010320049. The reversal of 204444010320001 is 100023010444402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 204444010320001 - 29 = 204444010319489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204444010327001) 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, 2377255933911 + ... + 2377255933996.
It is an arithmetic number, because the mean of its divisors is an integer number (52299630546988).
Almost surely, 2204444010320001 is an apocalyptic number.
It is an amenable number.
204444010320001 is a deficient number, since it is larger than the sum of its proper divisors (4754511867951).
204444010320001 is an equidigital number, since it uses as much as digits as its factorization.
204444010320001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4754511867950.
The product of its (nonzero) digits is 3072, while the sum is 25.
Adding to 204444010320001 its reverse (100023010444402), we get a palindrome (304467020764403).
The spelling of 204444010320001 in words is "two hundred four trillion, four hundred forty-four billion, ten million, three hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •