Base | Representation |
---|---|
bin | 10101101001011101… |
… | …101000110001011101 |
3 | 2012222221002101022102 |
4 | 111221131220301131 |
5 | 340101004311331 |
6 | 14402300054445 |
7 | 1452004360556 |
oct | 255135506135 |
9 | 65887071272 |
10 | 23244213341 |
11 | 9948830578 |
12 | 4608534425 |
13 | 22658569bb |
14 | 11a70dd32d |
15 | 91099e4cb |
hex | 569768c5d |
23244213341 has 4 divisors (see below), whose sum is σ = 23252514684. Its totient is φ = 23235912000.
The previous prime is 23244213301. The next prime is 23244213347. The reversal of 23244213341 is 14331244232.
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 13934858116 + 9309355225 = 118046^2 + 96485^2 .
It is a cyclic number.
It is not a de Polignac number, because 23244213341 - 210 = 23244212317 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 (23244213347) 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, 4146470 + ... + 4152071.
It is an arithmetic number, because the mean of its divisors is an integer number (5813128671).
Almost surely, 223244213341 is an apocalyptic number.
It is an amenable number.
23244213341 is a deficient number, since it is larger than the sum of its proper divisors (8301343).
23244213341 is an equidigital number, since it uses as much as digits as its factorization.
23244213341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8301342.
The product of its digits is 13824, while the sum is 29.
Adding to 23244213341 its reverse (14331244232), we get a palindrome (37575457573).
The spelling of 23244213341 in words is "twenty-three billion, two hundred forty-four million, two hundred thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •