Base | Representation |
---|---|
bin | 100110101011… |
… | …100101110111 |
3 | 201002011111102 |
4 | 212223211313 |
5 | 10043440043 |
6 | 1001200315 |
7 | 152121515 |
oct | 46534567 |
9 | 21064442 |
10 | 10140023 |
11 | 57a6393 |
12 | 349009b |
13 | 214051a |
14 | 14bd4b5 |
15 | d546b8 |
hex | 9ab977 |
10140023 has 4 divisors (see below), whose sum is σ = 10146408. Its totient is φ = 10133640.
The previous prime is 10140019. The next prime is 10140029. The reversal of 10140023 is 32004101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 32004101 = 2297 ⋅13933.
It is a cyclic number.
It is not a de Polignac number, because 10140023 - 22 = 10140019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10139986 and 10140013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140029) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1265 + ... + 4677.
It is an arithmetic number, because the mean of its divisors is an integer number (2536602).
Almost surely, 210140023 is an apocalyptic number.
10140023 is a deficient number, since it is larger than the sum of its proper divisors (6385).
10140023 is an equidigital number, since it uses as much as digits as its factorization.
10140023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6384.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 10140023 is about 3184.3402770433. The cubic root of 10140023 is about 216.4443797832. Note that the first 3 decimals are identical.
Adding to 10140023 its reverse (32004101), we get a palindrome (42144124).
The spelling of 10140023 in words is "ten million, one hundred forty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •