Base | Representation |
---|---|
bin | 10110000100011001… |
… | …010111001111101101 |
3 | 2021011102100110211022 |
4 | 112010121113033231 |
5 | 342012143442210 |
6 | 14515201103525 |
7 | 1466132223641 |
oct | 260431271755 |
9 | 67142313738 |
10 | 23696077805 |
11 | a05a8aaa84 |
12 | 4713927ba5 |
13 | 230835721a |
14 | 120b124c21 |
15 | 93a4aa155 |
hex | 5846573ed |
23696077805 has 4 divisors (see below), whose sum is σ = 28435293372. Its totient is φ = 18956862240.
The previous prime is 23696077777. The next prime is 23696077807. The reversal of 23696077805 is 50877069632.
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 6532195684 + 17163882121 = 80822^2 + 131011^2 .
It is not a de Polignac number, because 23696077805 - 220 = 23695029229 is a prime.
It is a super-2 number, since 2×236960778052 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23696077807) 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 3 ways as a sum of consecutive naturals, for example, 2369607776 + ... + 2369607785.
It is an arithmetic number, because the mean of its divisors is an integer number (7108823343).
Almost surely, 223696077805 is an apocalyptic number.
It is an amenable number.
23696077805 is a deficient number, since it is larger than the sum of its proper divisors (4739215567).
23696077805 is an equidigital number, since it uses as much as digits as its factorization.
23696077805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4739215566.
The product of its (nonzero) digits is 3810240, while the sum is 53.
The spelling of 23696077805 in words is "twenty-three billion, six hundred ninety-six million, seventy-seven thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •