Base | Representation |
---|---|
bin | 10110000011000100… |
… | …001101110111010101 |
3 | 2021002212100110122001 |
4 | 112003010031313111 |
5 | 341440440212031 |
6 | 14513042435301 |
7 | 1465441421056 |
oct | 260304156725 |
9 | 67085313561 |
10 | 23673757141 |
11 | a049245151 |
12 | 4708362b31 |
13 | 2303840728 |
14 | 120819472d |
15 | 93854b861 |
hex | 58310ddd5 |
23673757141 has 4 divisors (see below), whose sum is σ = 23700629484. Its totient is φ = 23646884800.
The previous prime is 23673757117. The next prime is 23673757207. The reversal of 23673757141 is 14175737632.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9040016241 + 14633740900 = 95079^2 + 120970^2 .
It is a cyclic number.
It is not a de Polignac number, because 23673757141 - 233 = 15083822549 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23673757091 and 23673757100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23673257141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13434850 + ... + 13436611.
It is an arithmetic number, because the mean of its divisors is an integer number (5925157371).
Almost surely, 223673757141 is an apocalyptic number.
It is an amenable number.
23673757141 is a deficient number, since it is larger than the sum of its proper divisors (26872343).
23673757141 is an equidigital number, since it uses as much as digits as its factorization.
23673757141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26872342.
The product of its digits is 740880, while the sum is 46.
The spelling of 23673757141 in words is "twenty-three billion, six hundred seventy-three million, seven hundred fifty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •