Base | Representation |
---|---|
bin | 101100010001… |
… | …1010111110001 |
3 | 1121200101000020 |
4 | 1120203113301 |
5 | 21420313203 |
6 | 2145314053 |
7 | 401211666 |
oct | 130432761 |
9 | 47611006 |
10 | 23213553 |
11 | 12115760 |
12 | 7935929 |
13 | 4a6a03c |
14 | 3123a6d |
15 | 2088153 |
hex | 16235f1 |
23213553 has 8 divisors (see below), whose sum is σ = 33765216. Its totient is φ = 14068800.
The previous prime is 23213539. The next prime is 23213569. The reversal of 23213553 is 35531232.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 23213553 - 28 = 23213297 is a prime.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (23213153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 351688 + ... + 351753.
It is an arithmetic number, because the mean of its divisors is an integer number (4220652).
Almost surely, 223213553 is an apocalyptic number.
It is an amenable number.
23213553 is a deficient number, since it is larger than the sum of its proper divisors (10551663).
23213553 is a wasteful number, since it uses less digits than its factorization.
23213553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703455.
The product of its digits is 2700, while the sum is 24.
The square root of 23213553 is about 4818.0445203423. The cubic root of 23213553 is about 285.2641564413.
Adding to 23213553 its reverse (35531232), we get a palindrome (58744785).
The spelling of 23213553 in words is "twenty-three million, two hundred thirteen thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •