Base | Representation |
---|---|
bin | 100001100001111100011… |
… | …010111001100010101011 |
3 | 22011021111221210200200221 |
4 | 201201330122321202223 |
5 | 300222440103200000 |
6 | 4522310310110511 |
7 | 325320654652246 |
oct | 41417432714253 |
9 | 8137457720627 |
10 | 2304189896875 |
11 | 809224143679 |
12 | 31269864b437 |
13 | 1393904421a9 |
14 | 7d74825825d |
15 | 3ee0d42261a |
hex | 2187c6b98ab |
2304189896875 has 12 divisors (see below), whose sum is σ = 2880053039808. Its totient is φ = 1843351915000.
The previous prime is 2304189896809. The next prime is 2304189896917. The reversal of 2304189896875 is 5786989814032.
2304189896875 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2304189896875 - 27 = 2304189896747 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 368667259 + ... + 368673508.
It is an arithmetic number, because the mean of its divisors is an integer number (240004419984).
It is a 1-persistent number, because it is pandigital, but 2⋅2304189896875 = 4608379793750 is not.
Almost surely, 22304189896875 is an apocalyptic number.
2304189896875 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
2304189896875 is a deficient number, since it is larger than the sum of its proper divisors (575863142933).
2304189896875 is an frugal number, since it uses more digits than its factorization.
2304189896875 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 737340792 (or 737340772 counting only the distinct ones).
The product of its (nonzero) digits is 209018880, while the sum is 70.
The spelling of 2304189896875 in words is "two trillion, three hundred four billion, one hundred eighty-nine million, eight hundred ninety-six thousand, eight hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •