Base | Representation |
---|---|
bin | 101110011111110111011111… |
… | …101110000010000001010001 |
3 | 222211002000022210100011101111 |
4 | 232133313133232002001101 |
5 | 203301012031000004023 |
6 | 2002534003432333321 |
7 | 61034432261654545 |
oct | 5637673756020121 |
9 | 884060283304344 |
10 | 204500031250513 |
11 | 5a183a81377389 |
12 | 1ab29586844241 |
13 | 8a153688275bb |
14 | 386dbd639da25 |
15 | 18997ad7a200d |
hex | b9fddfb82051 |
204500031250513 has 4 divisors (see below), whose sum is σ = 204500067847920. Its totient is φ = 204499994653108.
The previous prime is 204500031250469. The next prime is 204500031250523. The reversal of 204500031250513 is 315052130005402.
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 204500031250513 - 213 = 204500031242321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (204500031250523) 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, 7975795 + ... + 21739672.
It is an arithmetic number, because the mean of its divisors is an integer number (51125016961980).
Almost surely, 2204500031250513 is an apocalyptic number.
It is an amenable number.
204500031250513 is a deficient number, since it is larger than the sum of its proper divisors (36597407).
204500031250513 is an equidigital number, since it uses as much as digits as its factorization.
204500031250513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36597406.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 204500031250513 its reverse (315052130005402), we get a palindrome (519552161255915).
The spelling of 204500031250513 in words is "two hundred four trillion, five hundred billion, thirty-one million, two hundred fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •