Base | Representation |
---|---|
bin | 101110011110101110000101… |
… | …010110000111011000000111 |
3 | 222210210110212022000020210021 |
4 | 232132232011112013120013 |
5 | 203243214112114321411 |
6 | 2002433445545440011 |
7 | 61025642020112425 |
oct | 5636560526073007 |
9 | 883713768006707 |
10 | 204421205620231 |
11 | 5a153601360696 |
12 | 1ab162481a0007 |
13 | 8a0aab5ab1c12 |
14 | 386a0795a2115 |
15 | 18976e8459a71 |
hex | b9eb85587607 |
204421205620231 has 16 divisors (see below), whose sum is σ = 210673096318080. Its totient is φ = 198259184597760.
The previous prime is 204421205620207. The next prime is 204421205620241. The reversal of 204421205620231 is 132026502124402.
It is a cyclic number.
It is not a de Polignac number, because 204421205620231 - 215 = 204421205587463 is a prime.
It is a super-2 number, since 2×2044212056202312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204421205620241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12550786 + ... + 23798416.
It is an arithmetic number, because the mean of its divisors is an integer number (13167068519880).
Almost surely, 2204421205620231 is an apocalyptic number.
204421205620231 is a deficient number, since it is larger than the sum of its proper divisors (6251890697849).
204421205620231 is a wasteful number, since it uses less digits than its factorization.
204421205620231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11251626.
The product of its (nonzero) digits is 46080, while the sum is 34.
Adding to 204421205620231 its reverse (132026502124402), we get a palindrome (336447707744633).
The spelling of 204421205620231 in words is "two hundred four trillion, four hundred twenty-one billion, two hundred five million, six hundred twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •