Base | Representation |
---|---|
bin | 10101100111001100… |
… | …111001011100010101 |
3 | 2012220021200200211221 |
4 | 111213030321130111 |
5 | 340011301130431 |
6 | 14354422530341 |
7 | 1451034022003 |
oct | 254714713425 |
9 | 65807620757 |
10 | 23206270741 |
11 | 9929375755 |
12 | 45b78969b1 |
13 | 225aa30764 |
14 | 11a2063a73 |
15 | 90c4a7111 |
hex | 567339715 |
23206270741 has 4 divisors (see below), whose sum is σ = 23206653484. Its totient is φ = 23205888000.
The previous prime is 23206270679. The next prime is 23206270793. The reversal of 23206270741 is 14707260232.
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 17863391716 + 5342879025 = 133654^2 + 73095^2 .
It is a cyclic number.
It is not a de Polignac number, because 23206270741 - 27 = 23206270613 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23206270697 and 23206270706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23206270441) 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, 78060 + ... + 229141.
It is an arithmetic number, because the mean of its divisors is an integer number (5801663371).
Almost surely, 223206270741 is an apocalyptic number.
It is an amenable number.
23206270741 is a deficient number, since it is larger than the sum of its proper divisors (382743).
23206270741 is an equidigital number, since it uses as much as digits as its factorization.
23206270741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 382742.
The product of its (nonzero) digits is 28224, while the sum is 34.
The spelling of 23206270741 in words is "twenty-three billion, two hundred six million, two hundred seventy thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •