Base | Representation |
---|---|
bin | 1010100001100010100100… |
… | …00000111110110001011001 |
3 | 10000221102020202021110122022 |
4 | 11100301102000332301121 |
5 | 11013132131400422143 |
6 | 121115331403504225 |
7 | 4606000453265000 |
oct | 520612200766131 |
9 | 100842222243568 |
10 | 23142659779673 |
11 | 7412824132775 |
12 | 2719251b28075 |
13 | cbb460749445 |
14 | 5a0179b05c37 |
15 | 2a1ed8a89268 |
hex | 150c5203ec59 |
23142659779673 has 8 divisors (see below), whose sum is σ = 26988524524800. Its totient is φ = 19836565525140.
The previous prime is 23142659779669. The next prime is 23142659779699. The reversal of 23142659779673 is 37697795624132.
It is not a de Polignac number, because 23142659779673 - 22 = 23142659779669 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23142659779597 and 23142659779606.
It is not an unprimeable number, because it can be changed into a prime (23142659739673) 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, 33735655313 + ... + 33735655998.
It is an arithmetic number, because the mean of its divisors is an integer number (3373565565600).
Almost surely, 223142659779673 is an apocalyptic number.
It is an amenable number.
23142659779673 is a deficient number, since it is larger than the sum of its proper divisors (3845864745127).
23142659779673 is an frugal number, since it uses more digits than its factorization.
23142659779673 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67471311332 (or 67471311318 counting only the distinct ones).
The product of its digits is 720135360, while the sum is 71.
The spelling of 23142659779673 in words is "twenty-three trillion, one hundred forty-two billion, six hundred fifty-nine million, seven hundred seventy-nine thousand, six hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •