Base | Representation |
---|---|
bin | 101000000000… |
… | …100101000011 |
3 | 201201212000022 |
4 | 220000211003 |
5 | 10141110011 |
6 | 1012444055 |
7 | 155101433 |
oct | 50004503 |
9 | 21655008 |
10 | 10488131 |
11 | 5a13985 |
12 | 361962b |
13 | 2232ac4 |
14 | 15702c3 |
15 | dc28db |
hex | a00943 |
10488131 has 4 divisors (see below), whose sum is σ = 10771632. Its totient is φ = 10204632.
The previous prime is 10488109. The next prime is 10488139. The reversal of 10488131 is 13188401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13188401 = 43 ⋅306707.
It is a cyclic number.
It is not a de Polignac number, because 10488131 - 218 = 10225987 is a prime.
It is a super-2 number, since 2×104881312 = 220001783746322, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10488131.
It is not an unprimeable number, because it can be changed into a prime (10488139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 141695 + ... + 141768.
It is an arithmetic number, because the mean of its divisors is an integer number (2692908).
Almost surely, 210488131 is an apocalyptic number.
10488131 is a deficient number, since it is larger than the sum of its proper divisors (283501).
10488131 is an equidigital number, since it uses as much as digits as its factorization.
10488131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 283500.
The product of its (nonzero) digits is 768, while the sum is 26.
The square root of 10488131 is about 3238.5384048981. The cubic root of 10488131 is about 218.8934171358.
The spelling of 10488131 in words is "ten million, four hundred eighty-eight thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •