Base | Representation |
---|---|
bin | 11110100110001… |
… | …101001101011101 |
3 | 1022202220222012120 |
4 | 132212031031131 |
5 | 2022403111221 |
6 | 122534253153 |
7 | 15502151634 |
oct | 3646151535 |
9 | 1282828176 |
10 | 513332061 |
11 | 243842a80 |
12 | 123ab71b9 |
13 | 824724a8 |
14 | 4c26651b |
15 | 300ed5c6 |
hex | 1e98d35d |
513332061 has 8 divisors (see below), whose sum is σ = 746664864. Its totient is φ = 311110320.
The previous prime is 513332041. The next prime is 513332081. The reversal of 513332061 is 160233315.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (513332041) and next prime (513332081).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 513332061 - 26 = 513331997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (513332011) 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 7 ways as a sum of consecutive naturals, for example, 7777726 + ... + 7777791.
It is an arithmetic number, because the mean of its divisors is an integer number (93333108).
Almost surely, 2513332061 is an apocalyptic number.
It is an amenable number.
513332061 is a deficient number, since it is larger than the sum of its proper divisors (233332803).
513332061 is a wasteful number, since it uses less digits than its factorization.
513332061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15555531.
The product of its (nonzero) digits is 1620, while the sum is 24.
The square root of 513332061 is about 22656.8325456141. The cubic root of 513332061 is about 800.6931809725.
Adding to 513332061 its reverse (160233315), we get a palindrome (673565376).
The spelling of 513332061 in words is "five hundred thirteen million, three hundred thirty-two thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •