Base | Representation |
---|---|
bin | 100001100001111101101… |
… | …100010001110110111101 |
3 | 22011021120102221112102220 |
4 | 201201331230101312331 |
5 | 300223011033331031 |
6 | 4522312351235553 |
7 | 325321334203332 |
oct | 41417554216675 |
9 | 8137512845386 |
10 | 2304211230141 |
11 | 809235194677 |
12 | 3126a3818bb9 |
13 | 1393949a1422 |
14 | 7d74b00c989 |
15 | 3ee10238596 |
hex | 2187db11dbd |
2304211230141 has 16 divisors (see below), whose sum is σ = 3157917713664. Its totient is φ = 1493391242304.
The previous prime is 2304211230137. The next prime is 2304211230143. The reversal of 2304211230141 is 1410321124032.
It is not a de Polignac number, because 2304211230141 - 22 = 2304211230137 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2304211230143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8422101 + ... + 8691386.
It is an arithmetic number, because the mean of its divisors is an integer number (197369857104).
Almost surely, 22304211230141 is an apocalyptic number.
It is an amenable number.
2304211230141 is a deficient number, since it is larger than the sum of its proper divisors (853706483523).
2304211230141 is a wasteful number, since it uses less digits than its factorization.
2304211230141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17114740.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 2304211230141 its reverse (1410321124032), we get a palindrome (3714532354173).
It can be divided in two parts, 2304211 and 230141, that added together give a palindrome (2534352).
The spelling of 2304211230141 in words is "two trillion, three hundred four billion, two hundred eleven million, two hundred thirty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •