Base | Representation |
---|---|
bin | 101100101100… |
… | …1011111011111 |
3 | 1122002122002112 |
4 | 1121121133133 |
5 | 21444411411 |
6 | 2154144235 |
7 | 403124201 |
oct | 131313737 |
9 | 48078075 |
10 | 23435231 |
11 | 12257266 |
12 | 7a2207b |
13 | 4b16c01 |
14 | 3180771 |
15 | 20cdb8b |
hex | 16597df |
23435231 has 8 divisors (see below), whose sum is σ = 25419744. Its totient is φ = 21518080.
The previous prime is 23435221. The next prime is 23435239. The reversal of 23435231 is 13253432.
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 23435231 - 210 = 23434207 is a prime.
It is a super-2 number, since 2×234352312 = 1098420104046722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23435197 and 23435206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23435239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16115 + ... + 17508.
It is an arithmetic number, because the mean of its divisors is an integer number (3177468).
Almost surely, 223435231 is an apocalyptic number.
23435231 is a deficient number, since it is larger than the sum of its proper divisors (1984513).
23435231 is a wasteful number, since it uses less digits than its factorization.
23435231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33681.
The product of its digits is 2160, while the sum is 23.
The square root of 23435231 is about 4840.9948357750. The cubic root of 23435231 is about 286.1693252946.
Adding to 23435231 its reverse (13253432), we get a palindrome (36688663).
The spelling of 23435231 in words is "twenty-three million, four hundred thirty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •