Base | Representation |
---|---|
bin | 111011001110100… |
… | …0000000110000000 |
3 | 12010111111000101000 |
4 | 1312131000012000 |
5 | 13032223022143 |
6 | 525111012000 |
7 | 100150614336 |
oct | 16635000600 |
9 | 5114430330 |
10 | 1987314048 |
11 | 92a872505 |
12 | 47566a000 |
13 | 258955095 |
14 | 14bd15b56 |
15 | b9708bd3 |
hex | 76740180 |
1987314048 has 64 divisors (see below), whose sum is σ = 5865346800. Its totient is φ = 662436864.
The previous prime is 1987314047. The next prime is 1987314073. The reversal of 1987314048 is 8404137891.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 1987313994 and 1987314012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1987314047) 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, 284061 + ... + 290972.
Almost surely, 21987314048 is an apocalyptic number.
1987314048 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1987314048 is an abundant number, since it is smaller than the sum of its proper divisors (3878032752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1987314048 is an equidigital number, since it uses as much as digits as its factorization.
1987314048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 575056 (or 575038 counting only the distinct ones).
The product of its (nonzero) digits is 193536, while the sum is 45.
The square root of 1987314048 is about 44579.3006674622. The cubic root of 1987314048 is about 1257.2515146539.
The spelling of 1987314048 in words is "one billion, nine hundred eighty-seven million, three hundred fourteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •