Base | Representation |
---|---|
bin | 1010100000011010111011… |
… | …10100100011110011010011 |
3 | 10000210201222122022222112111 |
4 | 11100031131310203303103 |
5 | 11012014402001110103 |
6 | 121045531400410151 |
7 | 4603136456262553 |
oct | 520153564436323 |
9 | 100721878288474 |
10 | 23104203144403 |
11 | 73a848a393477 |
12 | 27118baa76957 |
13 | cb7942360364 |
14 | 59c36c4c9163 |
15 | 2a0ed781586d |
hex | 15035dd23cd3 |
23104203144403 has 8 divisors (see below), whose sum is σ = 23451655562496. Its totient is φ = 22757362979400.
The previous prime is 23104203144331. The next prime is 23104203144413. The reversal of 23104203144403 is 30444130240132.
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 23104203144403 - 225 = 23104169589971 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23104203144413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 152987233 + ... + 153138178.
It is an arithmetic number, because the mean of its divisors is an integer number (2931456945312).
Almost surely, 223104203144403 is an apocalyptic number.
23104203144403 is a deficient number, since it is larger than the sum of its proper divisors (347452418093).
23104203144403 is a wasteful number, since it uses less digits than its factorization.
23104203144403 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306126545.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 23104203144403 its reverse (30444130240132), we get a palindrome (53548333384535).
The spelling of 23104203144403 in words is "twenty-three trillion, one hundred four billion, two hundred three million, one hundred forty-four thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •