Base | Representation |
---|---|
bin | 1100100001000… |
… | …11010010010011 |
3 | 21022120122211211 |
4 | 12100203102103 |
5 | 203340032011 |
6 | 14230320551 |
7 | 2413334443 |
oct | 620432223 |
9 | 238518754 |
10 | 105002131 |
11 | 542a8723 |
12 | 2b1b9157 |
13 | 189a5550 |
14 | dd34123 |
15 | 9341b21 |
hex | 6423493 |
105002131 has 8 divisors (see below), whose sum is σ = 113379840. Its totient is φ = 96667392.
The previous prime is 105002099. The next prime is 105002141. The reversal of 105002131 is 131200501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105002131 - 25 = 105002099 is a prime.
It is a super-2 number, since 2×1050021312 = 22050895029082322, 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 (105002141) 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, 5566 + ... + 15523.
It is an arithmetic number, because the mean of its divisors is an integer number (14172480).
Almost surely, 2105002131 is an apocalyptic number.
105002131 is a deficient number, since it is larger than the sum of its proper divisors (8377709).
105002131 is a wasteful number, since it uses less digits than its factorization.
105002131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21485.
The product of its (nonzero) digits is 30, while the sum is 13.
The square root of 105002131 is about 10247.0547475848. The cubic root of 105002131 is about 471.7725895675.
Adding to 105002131 its reverse (131200501), we get a palindrome (236202632).
The spelling of 105002131 in words is "one hundred five million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •