Base | Representation |
---|---|
bin | 1111100001000… |
… | …00010111010011 |
3 | 100001220121110010 |
4 | 13300200113103 |
5 | 231304442422 |
6 | 20525410003 |
7 | 3140210343 |
oct | 760402723 |
9 | 301817403 |
10 | 130155987 |
11 | 67519135 |
12 | 37709903 |
13 | 20c717a0 |
14 | 13400d23 |
15 | b65eb0c |
hex | 7c205d3 |
130155987 has 8 divisors (see below), whose sum is σ = 186890704. Its totient is φ = 80095968.
The previous prime is 130155979. The next prime is 130155997. The reversal of 130155987 is 789551031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130155987 - 23 = 130155979 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39), and also a Moran number because the ratio is a prime number: 3337333 = 130155987 / (1 + 3 + 0 + 1 + 5 + 5 + 9 + 8 + 7).
It is not an unprimeable number, because it can be changed into a prime (130155917) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1668628 + ... + 1668705.
It is an arithmetic number, because the mean of its divisors is an integer number (23361338).
Almost surely, 2130155987 is an apocalyptic number.
130155987 is a deficient number, since it is larger than the sum of its proper divisors (56734717).
130155987 is a wasteful number, since it uses less digits than its factorization.
130155987 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3337349.
The product of its (nonzero) digits is 37800, while the sum is 39.
The square root of 130155987 is about 11408.5926827107. The cubic root of 130155987 is about 506.7822359196.
130155987 divided by its sum of digits (39) gives a palindrome (3337333).
The spelling of 130155987 in words is "one hundred thirty million, one hundred fifty-five thousand, nine hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •