Base | Representation |
---|---|
bin | 1010100100100001100110… |
… | …10000101101100111010101 |
3 | 10001022012222120010011121011 |
4 | 11102100303100231213111 |
5 | 11021322204043300414 |
6 | 121234412534052221 |
7 | 4616261203424161 |
oct | 522206320554725 |
9 | 101265876104534 |
10 | 23245223025109 |
11 | 745227543a028 |
12 | 27350b61aa071 |
13 | cc8027300557 |
14 | 5a510935bca1 |
15 | 2a49dcd43dc4 |
hex | 15243342d9d5 |
23245223025109 has 8 divisors (see below), whose sum is σ = 24079732268760. Its totient is φ = 22423454380800.
The previous prime is 23245223025061. The next prime is 23245223025137. The reversal of 23245223025109 is 90152032254232.
It can be written as a sum of positive squares in 4 ways, for example, as 56211668100 + 23189011357009 = 237090^2 + 4815497^2 .
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 23245223025109 - 217 = 23245222894037 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23245223025139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3185146122 + ... + 3185153419.
It is an arithmetic number, because the mean of its divisors is an integer number (3009966533595).
Almost surely, 223245223025109 is an apocalyptic number.
It is an amenable number.
23245223025109 is a deficient number, since it is larger than the sum of its proper divisors (834509243651).
23245223025109 is an equidigital number, since it uses as much as digits as its factorization.
23245223025109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6370299671.
The product of its (nonzero) digits is 259200, while the sum is 40.
The spelling of 23245223025109 in words is "twenty-three trillion, two hundred forty-five billion, two hundred twenty-three million, twenty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •