Base | Representation |
---|---|
bin | 1010011101011011010100… |
… | …01100110001001011100000 |
3 | 10000102220110100101011211210 |
4 | 11032231222030301023200 |
5 | 11003323211342232034 |
6 | 120530355454310120 |
7 | 4562535303510000 |
oct | 516555214611340 |
9 | 100386410334753 |
10 | 23001331602144 |
11 | 73688a0056155 |
12 | 26b598b4b8340 |
13 | cab029964bac |
14 | 5973add40000 |
15 | 29d4b645d8e9 |
hex | 14eb6a3312e0 |
23001331602144 has 120 divisors (see below), whose sum is σ = 70437387532680. Its totient is φ = 6571808963328.
The previous prime is 23001331602127. The next prime is 23001331602191. The reversal of 23001331602144 is 44120613310032.
It is a super-2 number, since 2×230013316021442 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 49664799 + ... + 50125790.
It is an arithmetic number, because the mean of its divisors is an integer number (586978229439).
Almost surely, 223001331602144 is an apocalyptic number.
23001331602144 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
23001331602144 is an abundant number, since it is smaller than the sum of its proper divisors (47436055930536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23001331602144 is an frugal number, since it uses more digits than its factorization.
23001331602144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99790630 (or 99790601 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 23001331602144 its reverse (44120613310032), we get a palindrome (67121944912176).
The spelling of 23001331602144 in words is "twenty-three trillion, one billion, three hundred thirty-one million, six hundred two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •