Base | Representation |
---|---|
bin | 101110011011110011111110… |
… | …100110011000100101001001 |
3 | 222210002101001212012101120020 |
4 | 232123303332212120211021 |
5 | 203231430334333341400 |
6 | 2002202001041251053 |
7 | 61005336042243660 |
oct | 5633637646304511 |
9 | 883071055171506 |
10 | 204221376465225 |
11 | 5a086887a798a9 |
12 | 1aaa3579933a89 |
13 | 89c4cbacac872 |
14 | 3860520073dd7 |
15 | 18923eeed12a0 |
hex | b9bcfe998949 |
204221376465225 has 48 divisors (see below), whose sum is σ = 385920470425728. Its totient is φ = 93348831306240.
The previous prime is 204221376465217. The next prime is 204221376465233. The reversal of 204221376465225 is 522564673122402.
It is an interprime number because it is at equal distance from previous prime (204221376465217) and next prime (204221376465233).
It is not a de Polignac number, because 204221376465225 - 23 = 204221376465217 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 14658294 + ... + 24966143.
It is an arithmetic number, because the mean of its divisors is an integer number (8040009800536).
Almost surely, 2204221376465225 is an apocalyptic number.
204221376465225 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
204221376465225 is a deficient number, since it is larger than the sum of its proper divisors (181699093960503).
204221376465225 is a wasteful number, since it uses less digits than its factorization.
204221376465225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39634274 (or 39634269 counting only the distinct ones).
The product of its (nonzero) digits is 9676800, while the sum is 51.
The spelling of 204221376465225 in words is "two hundred four trillion, two hundred twenty-one billion, three hundred seventy-six million, four hundred sixty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •