Base | Representation |
---|---|
bin | 1011111010010110100… |
… | …0101001111100111001 |
3 | 201120012212201001210002 |
4 | 2332211220221330321 |
5 | 11323101421024040 |
6 | 234002244002345 |
7 | 20533141240415 |
oct | 2764550517471 |
9 | 646185631702 |
10 | 204642361145 |
11 | 79874306902 |
12 | 337b23903b5 |
13 | 163b404b931 |
14 | 9c94887d45 |
15 | 54cacd3a15 |
hex | 2fa5a29f39 |
204642361145 has 8 divisors (see below), whose sum is σ = 245575653504. Its totient is φ = 163710675504.
The previous prime is 204642361139. The next prime is 204642361151. The reversal of 204642361145 is 541163246402.
It is an interprime number because it is at equal distance from previous prime (204642361139) and next prime (204642361151).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 204642361145 - 210 = 204642360121 is a prime.
It is a super-2 number, since 2×2046423611452 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 204642361099 and 204642361108.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 101009 + ... + 647678.
It is an arithmetic number, because the mean of its divisors is an integer number (30696956688).
Almost surely, 2204642361145 is an apocalyptic number.
It is an amenable number.
204642361145 is a deficient number, since it is larger than the sum of its proper divisors (40933292359).
204642361145 is an equidigital number, since it uses as much as digits as its factorization.
204642361145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 803359.
The product of its (nonzero) digits is 138240, while the sum is 38.
The spelling of 204642361145 in words is "two hundred four billion, six hundred forty-two million, three hundred sixty-one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •