Base | Representation |
---|---|
bin | 1010011110000110010110… |
… | …00010110100100100110011 |
3 | 10000112010002012101101212111 |
4 | 11033003023002310210303 |
5 | 11004213013343033133 |
6 | 120545135551310151 |
7 | 4564313604153460 |
oct | 517031302644463 |
9 | 100463065341774 |
10 | 23024431221043 |
11 | 73776741a678a |
12 | 26ba35751b357 |
13 | cb026b563245 |
14 | 598561b60667 |
15 | 29ddb939a1cd |
hex | 14f0cb0b4933 |
23024431221043 has 8 divisors (see below), whose sum is σ = 26313664700160. Its totient is φ = 19735204996680.
The previous prime is 23024431220951. The next prime is 23024431221073. The reversal of 23024431221043 is 34012213442032.
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-23024431221043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23024431220996 and 23024431221014.
It is not an unprimeable number, because it can be changed into a prime (23024431221073) 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, 11670648 + ... + 13500106.
It is an arithmetic number, because the mean of its divisors is an integer number (3289208087520).
Almost surely, 223024431221043 is an apocalyptic number.
23024431221043 is a deficient number, since it is larger than the sum of its proper divisors (3289233479117).
23024431221043 is a wasteful number, since it uses less digits than its factorization.
23024431221043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3627377.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 23024431221043 its reverse (34012213442032), we get a palindrome (57036644663075).
The spelling of 23024431221043 in words is "twenty-three trillion, twenty-four billion, four hundred thirty-one million, two hundred twenty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •