Base | Representation |
---|---|
bin | 101110011011110110110011… |
… | …000011101000110111111111 |
3 | 222210002122212212002202210220 |
4 | 232123312303003220313333 |
5 | 203232003034413024043 |
6 | 2002203221312432423 |
7 | 61005504054165153 |
oct | 5633666303506777 |
9 | 883078785082726 |
10 | 204224404033023 |
11 | 5a0880a0a59350 |
12 | 1aaa4083848713 |
13 | 89c53812c6cba |
14 | 386072a1b5063 |
15 | 189252abbd483 |
hex | b9bdb30e8dff |
204224404033023 has 64 divisors (see below), whose sum is σ = 311585904672768. Its totient is φ = 117860105877120.
The previous prime is 204224404033009. The next prime is 204224404033033. The reversal of 204224404033023 is 320330404422402.
It is not a de Polignac number, because 204224404033023 - 26 = 204224404032959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204224404033003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1810331286 + ... + 1810444092.
It is an arithmetic number, because the mean of its divisors is an integer number (4868529760512).
Almost surely, 2204224404033023 is an apocalyptic number.
204224404033023 is a deficient number, since it is larger than the sum of its proper divisors (107361500639745).
204224404033023 is a wasteful number, since it uses less digits than its factorization.
204224404033023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144452.
The product of its (nonzero) digits is 110592, while the sum is 33.
Adding to 204224404033023 its reverse (320330404422402), we get a palindrome (524554808455425).
The spelling of 204224404033023 in words is "two hundred four trillion, two hundred twenty-four billion, four hundred four million, thirty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •