Base | Representation |
---|---|
bin | 10101100110111001… |
… | …111110101000001001 |
3 | 2012212221100201200202 |
4 | 111212321332220021 |
5 | 340004013424431 |
6 | 14354124341545 |
7 | 1450643614553 |
oct | 254671765011 |
9 | 65787321622 |
10 | 23201311241 |
11 | 9926598599 |
12 | 45b60a48b5 |
13 | 22599b5244 |
14 | 11a15324d3 |
15 | 90bd278cb |
hex | 566e7ea09 |
23201311241 has 4 divisors (see below), whose sum is σ = 23297582484. Its totient is φ = 23105040000.
The previous prime is 23201311229. The next prime is 23201311271. The reversal of 23201311241 is 14211310232.
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 7867690000 + 15333621241 = 88700^2 + 123829^2 .
It is a cyclic number.
It is not a de Polignac number, because 23201311241 - 230 = 22127569417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23201311271) 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, 48135260 + ... + 48135741.
It is an arithmetic number, because the mean of its divisors is an integer number (5824395621).
Almost surely, 223201311241 is an apocalyptic number.
It is an amenable number.
23201311241 is a deficient number, since it is larger than the sum of its proper divisors (96271243).
23201311241 is an equidigital number, since it uses as much as digits as its factorization.
23201311241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96271242.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 23201311241 its reverse (14211310232), we get a palindrome (37412621473).
The spelling of 23201311241 in words is "twenty-three billion, two hundred one million, three hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •