Base | Representation |
---|---|
bin | 1011111000000011101… |
… | …1001100100000000101 |
3 | 201111121221210021002101 |
4 | 2332000323030200011 |
5 | 11320321233324021 |
6 | 233421203112101 |
7 | 20511652221604 |
oct | 2760073144005 |
9 | 644557707071 |
10 | 204026464261 |
11 | 79588690414 |
12 | 33660072631 |
13 | 163165783c9 |
14 | 9c36b63a3b |
15 | 5491bc5a91 |
hex | 2f80ecc805 |
204026464261 has 4 divisors (see below), whose sum is σ = 204028480224. Its totient is φ = 204024448300.
The previous prime is 204026464249. The next prime is 204026464289. The reversal of 204026464261 is 162464620402.
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 204026464261 - 29 = 204026463749 is a prime.
It is a super-2 number, since 2×2040264642612 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 204026464261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204026464361) 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, 847675 + ... + 1061416.
It is an arithmetic number, because the mean of its divisors is an integer number (51007120056).
Almost surely, 2204026464261 is an apocalyptic number.
It is an amenable number.
204026464261 is a deficient number, since it is larger than the sum of its proper divisors (2015963).
204026464261 is a wasteful number, since it uses less digits than its factorization.
204026464261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2015962.
The product of its (nonzero) digits is 110592, while the sum is 37.
The spelling of 204026464261 in words is "two hundred four billion, twenty-six million, four hundred sixty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •