Base | Representation |
---|---|
bin | 101100110100101… |
… | …1111111001010000 |
3 | 10212211010200210000 |
4 | 1121221133321100 |
5 | 11040014111033 |
6 | 405125010000 |
7 | 52162135443 |
oct | 13151377120 |
9 | 3784120700 |
10 | 1504050768 |
11 | 701aa7670 |
12 | 35b853900 |
13 | 1ac7acc8c |
14 | 103a7965a |
15 | 8c099a13 |
hex | 59a5fe50 |
1504050768 has 100 divisors (see below), whose sum is σ = 4748946048. Its totient is φ = 455768640.
The previous prime is 1504050727. The next prime is 1504050781. The reversal of 1504050768 is 8670504051.
1504050768 is a `hidden beast` number, since 1 + 50 + 40 + 507 + 68 = 666.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 38496 + ... + 67007.
Almost surely, 21504050768 is an apocalyptic number.
1504050768 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1504050768 is an abundant number, since it is smaller than the sum of its proper divisors (3244895280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1504050768 is a wasteful number, since it uses less digits than its factorization.
1504050768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105534 (or 105519 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The square root of 1504050768 is about 38782.0933937301. The cubic root of 1504050768 is about 1145.7437545551.
The spelling of 1504050768 in words is "one billion, five hundred four million, fifty thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •