Base | Representation |
---|---|
bin | 10101101001011010… |
… | …101010100011111001 |
3 | 2012222212121210120120 |
4 | 111221122222203321 |
5 | 340100304343413 |
6 | 14402231243453 |
7 | 1451664634245 |
oct | 255132524371 |
9 | 65885553516 |
10 | 23243434233 |
11 | 9948349188 |
12 | 4608219589 |
13 | 22656431a6 |
14 | 11a6d79425 |
15 | 910898723 |
hex | 5696aa8f9 |
23243434233 has 8 divisors (see below), whose sum is σ = 31016467200. Its totient is φ = 15483012048.
The previous prime is 23243434219. The next prime is 23243434237. The reversal of 23243434233 is 33243434232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23243434233 - 214 = 23243417849 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 23243434194 and 23243434203.
It is not an unprimeable number, because it can be changed into a prime (23243434237) 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 7 ways as a sum of consecutive naturals, for example, 3148393 + ... + 3155766.
It is an arithmetic number, because the mean of its divisors is an integer number (3877058400).
Almost surely, 223243434233 is an apocalyptic number.
It is an amenable number.
23243434233 is a deficient number, since it is larger than the sum of its proper divisors (7773032967).
23243434233 is a wasteful number, since it uses less digits than its factorization.
23243434233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6305391.
The product of its digits is 124416, while the sum is 33.
Adding to 23243434233 its reverse (33243434232), we get a palindrome (56486868465).
Subtracting 23243434233 from its reverse (33243434232), we obtain a palindrome (9999999999).
The spelling of 23243434233 in words is "twenty-three billion, two hundred forty-three million, four hundred thirty-four thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •