Base | Representation |
---|---|
bin | 1010011110100011111111… |
… | …00010000001101100111001 |
3 | 10000120122011012110121001002 |
4 | 11033101333202001230321 |
5 | 11004443111103431131 |
6 | 121000331001534345 |
7 | 4565416131235205 |
oct | 517217742015471 |
9 | 100518135417032 |
10 | 23040344202041 |
11 | 738339a706951 |
12 | 27014587a43b5 |
13 | cb190629c32a |
14 | 59923131db05 |
15 | 29e4eb4026cb |
hex | 14f47f881b39 |
23040344202041 has 8 divisors (see below), whose sum is σ = 23576549557440. Its totient is φ = 22504156273872.
The previous prime is 23040344202019. The next prime is 23040344202067. The reversal of 23040344202041 is 14020244304032.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23040344202041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23040344201995 and 23040344202013.
It is not an unprimeable number, because it can be changed into a prime (23040344202341) 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, 1662701 + ... + 6988938.
It is an arithmetic number, because the mean of its divisors is an integer number (2947068694680).
Almost surely, 223040344202041 is an apocalyptic number.
It is an amenable number.
23040344202041 is a deficient number, since it is larger than the sum of its proper divisors (536205355399).
23040344202041 is an equidigital number, since it uses as much as digits as its factorization.
23040344202041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8713615.
The product of its (nonzero) digits is 18432, while the sum is 29.
Adding to 23040344202041 its reverse (14020244304032), we get a palindrome (37060588506073).
The spelling of 23040344202041 in words is "twenty-three trillion, forty billion, three hundred forty-four million, two hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •