Base | Representation |
---|---|
bin | 100111110000… |
… | …101011100011 |
3 | 201121112200110 |
4 | 213300223203 |
5 | 10132014021 |
6 | 1011222403 |
7 | 154410534 |
oct | 47605343 |
9 | 21545613 |
10 | 10423011 |
11 | 5979a65 |
12 | 35a7a03 |
13 | 220c281 |
14 | 155468b |
15 | dad476 |
hex | 9f0ae3 |
10423011 has 8 divisors (see below), whose sum is σ = 14273104. Its totient is φ = 6760800.
The previous prime is 10423003. The next prime is 10423019. The reversal of 10423011 is 11032401.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10423003) and next prime (10423019).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10423011 - 23 = 10423003 is a prime.
It is a super-2 number, since 2×104230112 = 217278316612242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10423019) 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, 46840 + ... + 47061.
It is an arithmetic number, because the mean of its divisors is an integer number (1784138).
Almost surely, 210423011 is an apocalyptic number.
10423011 is a deficient number, since it is larger than the sum of its proper divisors (3850093).
10423011 is an equidigital number, since it uses as much as digits as its factorization.
10423011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93941.
The product of its (nonzero) digits is 24, while the sum is 12.
The square root of 10423011 is about 3228.4688321246. The cubic root of 10423011 is about 218.4394454709.
Adding to 10423011 its reverse (11032401), we get a palindrome (21455412).
The spelling of 10423011 in words is "ten million, four hundred twenty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •