Base | Representation |
---|---|
bin | 101100110100111… |
… | …0100011101100101 |
3 | 10212211021222100012 |
4 | 1121221310131211 |
5 | 11040024310023 |
6 | 405130500005 |
7 | 52162636163 |
oct | 13151643545 |
9 | 3784258305 |
10 | 1504135013 |
11 | 702054997 |
12 | 35b894605 |
13 | 1ac80c424 |
14 | 103a9c233 |
15 | 8c0b4978 |
hex | 59a74765 |
1504135013 has 2 divisors, whose sum is σ = 1504135014. Its totient is φ = 1504135012.
The previous prime is 1504135007. The next prime is 1504135033. The reversal of 1504135013 is 3105314051.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1504121089 + 13924 = 38783^2 + 118^2 .
It is a cyclic number.
It is not a de Polignac number, because 1504135013 - 218 = 1503872869 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1504135013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1504135033) 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 as a sum of consecutive naturals, namely, 752067506 + 752067507.
It is an arithmetic number, because the mean of its divisors is an integer number (752067507).
Almost surely, 21504135013 is an apocalyptic number.
It is an amenable number.
1504135013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1504135013 is an equidigital number, since it uses as much as digits as its factorization.
1504135013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 23.
The square root of 1504135013 is about 38783.1795112263. The cubic root of 1504135013 is about 1145.7651459829.
Adding to 1504135013 its reverse (3105314051), we get a palindrome (4609449064).
The spelling of 1504135013 in words is "one billion, five hundred four million, one hundred thirty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •