Base | Representation |
---|---|
bin | 101011111111… |
… | …1000111000111 |
3 | 1121101211021102 |
4 | 1113333013013 |
5 | 21401040111 |
6 | 2142210315 |
7 | 400022663 |
oct | 127770707 |
9 | 47354242 |
10 | 23065031 |
11 | 12024110 |
12 | 788399b |
13 | 4a17562 |
14 | 30c58a3 |
15 | 205913b |
hex | 15ff1c7 |
23065031 has 8 divisors (see below), whose sum is σ = 26486400. Its totient is φ = 19864440.
The previous prime is 23065019. The next prime is 23065087. The reversal of 23065031 is 13056032.
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 23065031 - 26 = 23064967 is a prime.
It is a super-2 number, since 2×230650312 = 1063991310061922, 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 = 23064994 and 23065012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23065631) 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, 54971 + ... + 55388.
It is an arithmetic number, because the mean of its divisors is an integer number (3310800).
Almost surely, 223065031 is an apocalyptic number.
23065031 is a deficient number, since it is larger than the sum of its proper divisors (3421369).
23065031 is a wasteful number, since it uses less digits than its factorization.
23065031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110389.
The product of its (nonzero) digits is 540, while the sum is 20.
The square root of 23065031 is about 4802.6066880393. The cubic root of 23065031 is about 284.6544740509.
It can be divided in two parts, 2306 and 5031, that added together give a palindrome (7337).
The spelling of 23065031 in words is "twenty-three million, sixty-five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •