Base | Representation |
---|---|
bin | 101110011010000011000111… |
… | …111111000011011011001001 |
3 | 222202122210021221101002110111 |
4 | 232122003013333003123021 |
5 | 203222434202440213001 |
6 | 2002030201000514321 |
7 | 60663516151530502 |
oct | 5632030777033311 |
9 | 882583257332414 |
10 | 204100201101001 |
11 | 5a03a455705197 |
12 | 1aa83ba047b9a1 |
13 | 89b674944850a |
14 | 38587069b1ba9 |
15 | 188e1abc59851 |
hex | b9a0c7fc36c9 |
204100201101001 has 4 divisors (see below), whose sum is σ = 210684078555904. Its totient is φ = 197516323646100.
The previous prime is 204100201100959. The next prime is 204100201101019. The reversal of 204100201101001 is 100101102001402.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 204100201101001 - 29 = 204100201100489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204100201101061) 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, 3291938727405 + ... + 3291938727466.
It is an arithmetic number, because the mean of its divisors is an integer number (52671019638976).
Almost surely, 2204100201101001 is an apocalyptic number.
It is an amenable number.
204100201101001 is a deficient number, since it is larger than the sum of its proper divisors (6583877454903).
204100201101001 is an equidigital number, since it uses as much as digits as its factorization.
204100201101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6583877454902.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 204100201101001 its reverse (100101102001402), we get a palindrome (304201303102403).
The spelling of 204100201101001 in words is "two hundred four trillion, one hundred billion, two hundred one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •