Base | Representation |
---|---|
bin | 1010100100011010000111… |
… | …00010010101011110101001 |
3 | 10001021211121021011212101110 |
4 | 11102031003202111132221 |
5 | 11021240434441104001 |
6 | 121232505502340533 |
7 | 4616056425635664 |
oct | 522150342253651 |
9 | 101254537155343 |
10 | 23241201113001 |
11 | 74505a1149a23 |
12 | 273437328a749 |
13 | cc7835ca92c1 |
14 | 5a4c471426db |
15 | 2a4854be13d6 |
hex | 1523438957a9 |
23241201113001 has 8 divisors (see below), whose sum is σ = 30992920371904. Its totient is φ = 15491807964720.
The previous prime is 23241201112979. The next prime is 23241201113023. The reversal of 23241201113001 is 10031110214232.
It is an interprime number because it is at equal distance from previous prime (23241201112979) and next prime (23241201113023).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23241201113001 - 26 = 23241201112937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23241201112001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 581504341 + ... + 581544306.
It is an arithmetic number, because the mean of its divisors is an integer number (3874115046488).
Almost surely, 223241201113001 is an apocalyptic number.
It is an amenable number.
23241201113001 is a deficient number, since it is larger than the sum of its proper divisors (7751719258903).
23241201113001 is a wasteful number, since it uses less digits than its factorization.
23241201113001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163055311.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 23241201113001 its reverse (10031110214232), we get a palindrome (33272311327233).
The spelling of 23241201113001 in words is "twenty-three trillion, two hundred forty-one billion, two hundred one million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •