Base | Representation |
---|---|
bin | 1010100000011010110100… |
… | …01111010000100000101011 |
3 | 10000210201211110020002010111 |
4 | 11100031122033100200223 |
5 | 11012014241104100121 |
6 | 121045521412155151 |
7 | 4603135126330015 |
oct | 520153217204053 |
9 | 100721743202114 |
10 | 23104143034411 |
11 | 73a845946799a |
12 | 27118a2908ab7 |
13 | cb7932a7530a |
14 | 59c36451d1b5 |
15 | 2a0ed23e02e1 |
hex | 15035a3d082b |
23104143034411 has 8 divisors (see below), whose sum is σ = 23123143422720. Its totient is φ = 23085144897192.
The previous prime is 23104143034363. The next prime is 23104143034417. The reversal of 23104143034411 is 11443034140132.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23104143034411 - 211 = 23104143032363 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23104143034417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20289946 + ... + 21398368.
It is an arithmetic number, because the mean of its divisors is an integer number (2890392927840).
Almost surely, 223104143034411 is an apocalyptic number.
23104143034411 is a deficient number, since it is larger than the sum of its proper divisors (19000388309).
23104143034411 is a wasteful number, since it uses less digits than its factorization.
23104143034411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1125545.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 23104143034411 its reverse (11443034140132), we get a palindrome (34547177174543).
The spelling of 23104143034411 in words is "twenty-three trillion, one hundred four billion, one hundred forty-three million, thirty-four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •