Base | Representation |
---|---|
bin | 11111111110101… |
… | …000011000001101 |
3 | 1101101112122010022 |
4 | 133332220120031 |
5 | 2044321341023 |
6 | 125123151525 |
7 | 16203163652 |
oct | 3776503015 |
9 | 1341478108 |
10 | 536512013 |
11 | 255935464 |
12 | 12b8155a5 |
13 | 871ca13b |
14 | 5137bc29 |
15 | 3217b7c8 |
hex | 1ffa860d |
536512013 has 4 divisors (see below), whose sum is σ = 536873820. Its totient is φ = 536150208.
The previous prime is 536512001. The next prime is 536512037. The reversal of 536512013 is 310215635.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 89908324 + 446603689 = 9482^2 + 21133^2 .
It is a cyclic number.
It is not a de Polignac number, because 536512013 - 28 = 536511757 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 (536512073) 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, 178670 + ... + 181647.
It is an arithmetic number, because the mean of its divisors is an integer number (134218455).
Almost surely, 2536512013 is an apocalyptic number.
It is an amenable number.
536512013 is a deficient number, since it is larger than the sum of its proper divisors (361807).
536512013 is a wasteful number, since it uses less digits than its factorization.
536512013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 361806.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 536512013 is about 23162.7289627108. The cubic root of 536512013 is about 812.5681901901.
Adding to 536512013 its reverse (310215635), we get a palindrome (846727648).
The spelling of 536512013 in words is "five hundred thirty-six million, five hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •