Base | Representation |
---|---|
bin | 101100011001… |
… | …1101111110111 |
3 | 1121210210000121 |
4 | 1120303233313 |
5 | 21424440011 |
6 | 2150552411 |
7 | 401611363 |
oct | 130635767 |
9 | 47723017 |
10 | 23280631 |
11 | 121610a0 |
12 | 7968707 |
13 | 4a9172a |
14 | 31402a3 |
15 | 209ce71 |
hex | 1633bf7 |
23280631 has 8 divisors (see below), whose sum is σ = 25432704. Its totient is φ = 21134520.
The previous prime is 23280619. The next prime is 23280637. The reversal of 23280631 is 13608232.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-23280631 is a prime.
It is a super-2 number, since 2×232806312 = 1083975559516322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 23280596 and 23280605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23280637) 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, 12166 + ... + 13948.
It is an arithmetic number, because the mean of its divisors is an integer number (3179088).
Almost surely, 223280631 is an apocalyptic number.
23280631 is a deficient number, since it is larger than the sum of its proper divisors (2152073).
23280631 is a wasteful number, since it uses less digits than its factorization.
23280631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2981.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 23280631 is about 4825.0006217616. Note that the first 3 decimals coincide. The cubic root of 23280631 is about 285.5386591252.
Adding to 23280631 its reverse (13608232), we get a palindrome (36888863).
The spelling of 23280631 in words is "twenty-three million, two hundred eighty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •