Base | Representation |
---|---|
bin | 101000110100… |
… | …010101100011 |
3 | 202010121211011 |
4 | 220310111203 |
5 | 10214401011 |
6 | 1021201351 |
7 | 156643501 |
oct | 50642543 |
9 | 22117734 |
10 | 10700131 |
11 | 6049192 |
12 | 3700257 |
13 | 22a8450 |
14 | 15c7671 |
15 | e15621 |
hex | a34563 |
10700131 has 8 divisors (see below), whose sum is σ = 11615744. Its totient is φ = 9797760.
The previous prime is 10700069. The next prime is 10700143. The reversal of 10700131 is 13100701.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a 7-Lehmer number, since φ(10700131) divides (10700131-1)7.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10700131 is a prime.
It is a super-2 number, since 2×107001312 = 228985606834322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10700831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1590 + ... + 4891.
It is an arithmetic number, because the mean of its divisors is an integer number (1451968).
Almost surely, 210700131 is an apocalyptic number.
10700131 is a deficient number, since it is larger than the sum of its proper divisors (915613).
10700131 is a wasteful number, since it uses less digits than its factorization.
10700131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6621.
The product of its (nonzero) digits is 21, while the sum is 13.
The square root of 10700131 is about 3271.1054706322. The cubic root of 10700131 is about 220.3584445969.
Adding to 10700131 its reverse (13100701), we get a palindrome (23800832).
The spelling of 10700131 in words is "ten million, seven hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •