Base | Representation |
---|---|
bin | 1011111000110010100… |
… | …1110001100011011111 |
3 | 201112010200000200202021 |
4 | 2332030221301203133 |
5 | 11321222121132111 |
6 | 233452512241011 |
7 | 20516561522341 |
oct | 2761451614337 |
9 | 645120020667 |
10 | 204223224031 |
11 | 7967975a9a2 |
12 | 336b5b40167 |
13 | 163482698c8 |
14 | 9c54d41291 |
15 | 54a40ded71 |
hex | 2f8ca718df |
204223224031 has 4 divisors (see below), whose sum is σ = 211265404200. Its totient is φ = 197181043864.
The previous prime is 204223224011. The next prime is 204223224071. The reversal of 204223224031 is 130422322402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 204223224031 - 27 = 204223223903 is a prime.
It is a super-2 number, since 2×2042232240312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 204223223987 and 204223224005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (204223224001) 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, 3521090041 + ... + 3521090098.
It is an arithmetic number, because the mean of its divisors is an integer number (52816351050).
Almost surely, 2204223224031 is an apocalyptic number.
204223224031 is a deficient number, since it is larger than the sum of its proper divisors (7042180169).
204223224031 is an equidigital number, since it uses as much as digits as its factorization.
204223224031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7042180168.
The product of its (nonzero) digits is 4608, while the sum is 25.
Adding to 204223224031 its reverse (130422322402), we get a palindrome (334645546433).
The spelling of 204223224031 in words is "two hundred four billion, two hundred twenty-three million, two hundred twenty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •