Base | Representation |
---|---|
bin | 101011111010… |
… | …0001110001111 |
3 | 1121022120002120 |
4 | 1113310032033 |
5 | 21343123211 |
6 | 2141224023 |
7 | 366445650 |
oct | 127641617 |
9 | 47276076 |
10 | 23020431 |
11 | 11aa3655 |
12 | 7862013 |
13 | 4a00175 |
14 | 30b3527 |
15 | 204ad06 |
hex | 15f438f |
23020431 has 16 divisors (see below), whose sum is σ = 37142784. Its totient is φ = 12380544.
The previous prime is 23020429. The next prime is 23020433. The reversal of 23020431 is 13402032.
It is an interprime number because it is at equal distance from previous prime (23020429) and next prime (23020433).
It is not a de Polignac number, because 23020431 - 21 = 23020429 is a prime.
It is a super-2 number, since 2×230204312 = 1059880486851522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23020431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23020433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31885 + ... + 32598.
It is an arithmetic number, because the mean of its divisors is an integer number (2321424).
Almost surely, 223020431 is an apocalyptic number.
23020431 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23020431 is a deficient number, since it is larger than the sum of its proper divisors (14122353).
23020431 is a wasteful number, since it uses less digits than its factorization.
23020431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64510.
The product of its (nonzero) digits is 144, while the sum is 15.
The square root of 23020431 is about 4797.9611294799. The cubic root of 23020431 is about 284.4708803770.
Adding to 23020431 its reverse (13402032), we get a palindrome (36422463).
The spelling of 23020431 in words is "twenty-three million, twenty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •