Base | Representation |
---|---|
bin | 101101000101111… |
… | …0010100110101101 |
3 | 10220110001102002200 |
4 | 1122023302212231 |
5 | 11044314242201 |
6 | 410045412113 |
7 | 52331426133 |
oct | 13213624655 |
9 | 3813042080 |
10 | 1513040301 |
11 | 707087633 |
12 | 36286a039 |
13 | 1b1609926 |
14 | 104d39753 |
15 | 8cc73386 |
hex | 5a2f29ad |
1513040301 has 6 divisors (see below), whose sum is σ = 2185502670. Its totient is φ = 1008693528.
The previous prime is 1513040293. The next prime is 1513040339. The reversal of 1513040301 is 1030403151.
It can be written as a sum of positive squares in only one way, i.e., 1234116900 + 278923401 = 35130^2 + 16701^2 .
It is not a de Polignac number, because 1513040301 - 23 = 1513040293 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1513040201) 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 5 ways as a sum of consecutive naturals, for example, 84057786 + ... + 84057803.
It is an arithmetic number, because the mean of its divisors is an integer number (364250445).
Almost surely, 21513040301 is an apocalyptic number.
It is an amenable number.
1513040301 is a deficient number, since it is larger than the sum of its proper divisors (672462369).
1513040301 is a wasteful number, since it uses less digits than its factorization.
1513040301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168115595 (or 168115592 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 1513040301 is about 38897.8187177636. The cubic root of 1513040301 is about 1148.0218800336.
Adding to 1513040301 its reverse (1030403151), we get a palindrome (2543443452).
The spelling of 1513040301 in words is "one billion, five hundred thirteen million, forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •