Base | Representation |
---|---|
bin | 1111101011010… |
… | …10111011110011 |
3 | 100011110101210212 |
4 | 13311222323303 |
5 | 232131310003 |
6 | 21014414335 |
7 | 3154550042 |
oct | 765527363 |
9 | 304411725 |
10 | 131510003 |
11 | 68263459 |
12 | 380613ab |
13 | 21326b91 |
14 | 13674559 |
15 | b82add8 |
hex | 7d6aef3 |
131510003 has 4 divisors (see below), whose sum is σ = 131533080. Its totient is φ = 131486928.
The previous prime is 131509993. The next prime is 131510009. The reversal of 131510003 is 300015131.
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.
It is a cyclic number.
It is not a de Polignac number, because 131510003 - 214 = 131493619 is a prime.
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 131510003.
It is not an unprimeable number, because it can be changed into a prime (131510009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3863 + ... + 16671.
It is an arithmetic number, because the mean of its divisors is an integer number (32883270).
Almost surely, 2131510003 is an apocalyptic number.
131510003 is a deficient number, since it is larger than the sum of its proper divisors (23077).
131510003 is a wasteful number, since it uses less digits than its factorization.
131510003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23076.
The product of its (nonzero) digits is 45, while the sum is 14.
The square root of 131510003 is about 11467.7810844121. The cubic root of 131510003 is about 508.5335330642.
Adding to 131510003 its reverse (300015131), we get a palindrome (431525134).
The spelling of 131510003 in words is "one hundred thirty-one million, five hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •