Base | Representation |
---|---|
bin | 101101000101111… |
… | …0110100010011101 |
3 | 10220110002020012102 |
4 | 1122023312202131 |
5 | 11044320301123 |
6 | 410050014445 |
7 | 52331524121 |
oct | 13213664235 |
9 | 3813066172 |
10 | 1513056413 |
11 | 707098750 |
12 | 362877425 |
13 | 1b161406b |
14 | 104d41581 |
15 | 8cc78028 |
hex | 5a2f689d |
1513056413 has 4 divisors (see below), whose sum is σ = 1650607008. Its totient is φ = 1375505820.
The previous prime is 1513056397. The next prime is 1513056421. The reversal of 1513056413 is 3146503151.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1513056413 - 24 = 1513056397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1513056113) 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 3 ways as a sum of consecutive naturals, for example, 68775281 + ... + 68775302.
It is an arithmetic number, because the mean of its divisors is an integer number (412651752).
Almost surely, 21513056413 is an apocalyptic number.
It is an amenable number.
1513056413 is a deficient number, since it is larger than the sum of its proper divisors (137550595).
1513056413 is a wasteful number, since it uses less digits than its factorization.
1513056413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137550594.
The product of its (nonzero) digits is 5400, while the sum is 29.
The square root of 1513056413 is about 38898.0258239412. The cubic root of 1513056413 is about 1148.0259550215.
Adding to 1513056413 its reverse (3146503151), we get a palindrome (4659559564).
The spelling of 1513056413 in words is "one billion, five hundred thirteen million, fifty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •