Base | Representation |
---|---|
bin | 1010011110010110100100… |
… | …01000010101010101010001 |
3 | 10000112221120010120022000022 |
4 | 11033023102020111111101 |
5 | 11004333332322303131 |
6 | 120553140051433225 |
7 | 4565042453001314 |
oct | 517132210252521 |
9 | 100487503508008 |
10 | 23033140041041 |
11 | 7380333098089 |
12 | 26bbb87bb5815 |
13 | cb10288b3180 |
14 | 598b4a61a97b |
15 | 29e228c0b37b |
hex | 14f2d2215551 |
23033140041041 has 8 divisors (see below), whose sum is σ = 24806545424640. Its totient is φ = 21259966854672.
The previous prime is 23033140041017. The next prime is 23033140041053. The reversal of 23033140041041 is 14014004133032.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-23033140041041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23033140041041.
It is not an unprimeable number, because it can be changed into a prime (23033140041061) 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, 57843251 + ... + 58240088.
It is an arithmetic number, because the mean of its divisors is an integer number (3100818178080).
Almost surely, 223033140041041 is an apocalyptic number.
It is an amenable number.
23033140041041 is a deficient number, since it is larger than the sum of its proper divisors (1773405383599).
23033140041041 is a wasteful number, since it uses less digits than its factorization.
23033140041041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116098615.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 23033140041041 its reverse (14014004133032), we get a palindrome (37047144174073).
The spelling of 23033140041041 in words is "twenty-three trillion, thirty-three billion, one hundred forty million, forty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •