Base | Representation |
---|---|
bin | 111011001110111… |
… | …0010011000101010 |
3 | 12010111212110221102 |
4 | 1312131302120222 |
5 | 13032301120132 |
6 | 525115241402 |
7 | 100152433034 |
oct | 16635623052 |
9 | 5114773842 |
10 | 1987520042 |
11 | 92a9a3252 |
12 | 475749262 |
13 | 2589c7a81 |
14 | 14bd6ac54 |
15 | b9749c62 |
hex | 7677262a |
1987520042 has 8 divisors (see below), whose sum is σ = 3138189600. Its totient is φ = 941456844.
The previous prime is 1987520027. The next prime is 1987520047. The reversal of 1987520042 is 2400257891.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 52303159 = 1987520042 / (1 + 9 + 8 + 7 + 5 + 2 + 0 + 0 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1987519978 and 1987520005.
It is not an unprimeable number, because it can be changed into a prime (1987520047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 26151542 + ... + 26151617.
It is an arithmetic number, because the mean of its divisors is an integer number (392273700).
Almost surely, 21987520042 is an apocalyptic number.
1987520042 is a deficient number, since it is larger than the sum of its proper divisors (1150669558).
1987520042 is a wasteful number, since it uses less digits than its factorization.
1987520042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52303180.
The product of its (nonzero) digits is 40320, while the sum is 38.
The square root of 1987520042 is about 44581.6110296611. The cubic root of 1987520042 is about 1257.2949530695.
The spelling of 1987520042 in words is "one billion, nine hundred eighty-seven million, five hundred twenty thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •