Base | Representation |
---|---|
bin | 101100110100101… |
… | …0110001111011001 |
3 | 10212211001200112110 |
4 | 1121221112033121 |
5 | 11040011324400 |
6 | 405124102533 |
7 | 52161612243 |
oct | 13151261731 |
9 | 3784050473 |
10 | 1504011225 |
11 | 701a7a992 |
12 | 35b834a49 |
13 | 1ac797c92 |
14 | 103a69093 |
15 | 8c08ce50 |
hex | 59a563d9 |
1504011225 has 12 divisors (see below), whose sum is σ = 2486632016. Its totient is φ = 802139280.
The previous prime is 1504011217. The next prime is 1504011227. The reversal of 1504011225 is 5221104051.
1504011225 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1504011225 - 23 = 1504011217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1504011227) 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 11 ways as a sum of consecutive naturals, for example, 10026667 + ... + 10026816.
Almost surely, 21504011225 is an apocalyptic number.
1504011225 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1504011225 is a deficient number, since it is larger than the sum of its proper divisors (982620791).
1504011225 is a wasteful number, since it uses less digits than its factorization.
1504011225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20053496 (or 20053491 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 21.
The square root of 1504011225 is about 38781.5835803542. The cubic root of 1504011225 is about 1145.7337135504.
Adding to 1504011225 its reverse (5221104051), we get a palindrome (6725115276).
The spelling of 1504011225 in words is "one billion, five hundred four million, eleven thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •