Base | Representation |
---|---|
bin | 100110101011… |
… | …101001011011 |
3 | 201002011210212 |
4 | 212223221123 |
5 | 10043442001 |
6 | 1001201335 |
7 | 152122262 |
oct | 46535133 |
9 | 21064725 |
10 | 10140251 |
11 | 57a6580 |
12 | 349024b |
13 | 2140664 |
14 | 14bd5d9 |
15 | d547bb |
hex | 9aba5b |
10140251 has 4 divisors (see below), whose sum is σ = 11062104. Its totient is φ = 9218400.
The previous prime is 10140241. The next prime is 10140253. The reversal of 10140251 is 15204101.
10140251 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15204101 = 11 ⋅1382191.
It is a cyclic number.
It is not a de Polignac number, because 10140251 - 26 = 10140187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10140253) 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, 460910 + ... + 460931.
It is an arithmetic number, because the mean of its divisors is an integer number (2765526).
Almost surely, 210140251 is an apocalyptic number.
10140251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10140251 is a deficient number, since it is larger than the sum of its proper divisors (921853).
10140251 is an equidigital number, since it uses as much as digits as its factorization.
10140251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 921852.
The product of its (nonzero) digits is 40, while the sum is 14.
The square root of 10140251 is about 3184.3760770361. The cubic root of 10140251 is about 216.4460020329.
Adding to 10140251 its reverse (15204101), we get a palindrome (25344352).
The spelling of 10140251 in words is "ten million, one hundred forty thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •