Base | Representation |
---|---|
bin | 1010100001100101110011… |
… | …11010111011100011111101 |
3 | 10000221120202020111110110122 |
4 | 11100302321322323203331 |
5 | 11013144214133233000 |
6 | 121120220355344325 |
7 | 4606061611520225 |
oct | 520627172734375 |
9 | 100846666443418 |
10 | 23144403024125 |
11 | 7413539152069 |
12 | 27196598b20a5 |
13 | cbb67a957236 |
14 | 5a02a3447085 |
15 | 2a208bb31085 |
hex | 150cb9ebb8fd |
23144403024125 has 16 divisors (see below), whose sum is σ = 28884457113408. Its totient is φ = 18515367202000.
The previous prime is 23144403024121. The next prime is 23144403024173. The reversal of 23144403024125 is 52142030444132.
It is not a de Polignac number, because 23144403024125 - 22 = 23144403024121 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23144403024121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15565394 + ... + 16987356.
It is an arithmetic number, because the mean of its divisors is an integer number (1805278569588).
Almost surely, 223144403024125 is an apocalyptic number.
23144403024125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
23144403024125 is a deficient number, since it is larger than the sum of its proper divisors (5740054089283).
23144403024125 is a wasteful number, since it uses less digits than its factorization.
23144403024125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1552189 (or 1552179 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 35.
Adding to 23144403024125 its reverse (52142030444132), we get a palindrome (75286433468257).
The spelling of 23144403024125 in words is "twenty-three trillion, one hundred forty-four billion, four hundred three million, twenty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •