Base | Representation |
---|---|
bin | 1010100100011001111111… |
… | …11110010010110010001011 |
3 | 10001021211110002200201211012 |
4 | 11102030333332102302023 |
5 | 11021240324140130011 |
6 | 121232455525154135 |
7 | 4616055101546441 |
oct | 522147776226213 |
9 | 101254402621735 |
10 | 23241141333131 |
11 | 7450570429477 |
12 | 273435725b94b |
13 | cc78267a85b7 |
14 | 5a4c3d220b91 |
15 | 2a484e833a8b |
hex | 15233ff92c8b |
23241141333131 has 4 divisors (see below), whose sum is σ = 23301823164672. Its totient is φ = 23180459501592.
The previous prime is 23241141333121. The next prime is 23241141333133. The reversal of 23241141333131 is 13133314114232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23241141333131 - 222 = 23241137138827 is a prime.
It is a super-2 number, since 2×232411413331312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23241141333133) 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, 30340915196 + ... + 30340915961.
It is an arithmetic number, because the mean of its divisors is an integer number (5825455791168).
Almost surely, 223241141333131 is an apocalyptic number.
23241141333131 is a deficient number, since it is larger than the sum of its proper divisors (60681831541).
23241141333131 is an equidigital number, since it uses as much as digits as its factorization.
23241141333131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60681831540.
The product of its digits is 15552, while the sum is 32.
Adding to 23241141333131 its reverse (13133314114232), we get a palindrome (36374455447363).
The spelling of 23241141333131 in words is "twenty-three trillion, two hundred forty-one billion, one hundred forty-one million, three hundred thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •