Base | Representation |
---|---|
bin | 101110011011110011101110… |
… | …001000010000000001100001 |
3 | 222210002100100121020010110010 |
4 | 232123303232020100001201 |
5 | 203231424303113133101 |
6 | 2002201513410355133 |
7 | 61005326145400044 |
oct | 5633635610200141 |
9 | 883070317203403 |
10 | 204221100130401 |
11 | 5a086755a99412 |
12 | 1aaa350128baa9 |
13 | 89c4c75979533 |
14 | 38604d54a0c5b |
15 | 18923d5ae92d6 |
hex | b9bcee210061 |
204221100130401 has 4 divisors (see below), whose sum is σ = 272294800173872. Its totient is φ = 136147400086932.
The previous prime is 204221100130339. The next prime is 204221100130429. The reversal of 204221100130401 is 104031001122402.
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 not a de Polignac number, because 204221100130401 - 27 = 204221100130273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204221100150401) 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, 34036850021731 + ... + 34036850021736.
It is an arithmetic number, because the mean of its divisors is an integer number (68073700043468).
Almost surely, 2204221100130401 is an apocalyptic number.
It is an amenable number.
204221100130401 is a deficient number, since it is larger than the sum of its proper divisors (68073700043471).
204221100130401 is an equidigital number, since it uses as much as digits as its factorization.
204221100130401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68073700043470.
The product of its (nonzero) digits is 384, while the sum is 21.
Adding to 204221100130401 its reverse (104031001122402), we get a palindrome (308252101252803).
The spelling of 204221100130401 in words is "two hundred four trillion, two hundred twenty-one billion, one hundred million, one hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •