Base | Representation |
---|---|
bin | 1011111010010011000… |
… | …0100000010101110001 |
3 | 201120011212000020111221 |
4 | 2332210300200111301 |
5 | 11323034134013323 |
6 | 234001000305041 |
7 | 20532602153545 |
oct | 2764460402561 |
9 | 646155006457 |
10 | 204627641713 |
11 | 79866a72990 |
12 | 337a9472181 |
13 | 163b0c96c01 |
14 | 9c92935a25 |
15 | 54c987755d |
hex | 2fa4c20571 |
204627641713 has 4 divisors (see below), whose sum is σ = 223230154608. Its totient is φ = 186025128820.
The previous prime is 204627641707. The next prime is 204627641723. The reversal of 204627641713 is 317146726402.
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 204627641713 - 25 = 204627641681 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 204627641713.
It is not an unprimeable number, because it can be changed into a prime (204627641723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9301256431 + ... + 9301256452.
It is an arithmetic number, because the mean of its divisors is an integer number (55807538652).
Almost surely, 2204627641713 is an apocalyptic number.
It is an amenable number.
204627641713 is a deficient number, since it is larger than the sum of its proper divisors (18602512895).
204627641713 is a wasteful number, since it uses less digits than its factorization.
204627641713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18602512894.
The product of its (nonzero) digits is 338688, while the sum is 43.
The spelling of 204627641713 in words is "two hundred four billion, six hundred twenty-seven million, six hundred forty-one thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •