Base | Representation |
---|---|
bin | 11111111101010… |
… | …000011111001101 |
3 | 1101100212100021222 |
4 | 133331100133031 |
5 | 2044223331023 |
6 | 125111333125 |
7 | 16200134255 |
oct | 3775203715 |
9 | 1340770258 |
10 | 536152013 |
11 | 255709a41 |
12 | 12b6811a5 |
13 | 87102317 |
14 | 512c6965 |
15 | 32109cc8 |
hex | 1ff507cd |
536152013 has 4 divisors (see below), whose sum is σ = 564370560. Its totient is φ = 507933468.
The previous prime is 536152009. The next prime is 536152021. The reversal of 536152013 is 310251635.
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, and also an emirpimes, since its reverse is a distinct semiprime: 310251635 = 5 ⋅62050327.
It is a cyclic number.
It is not a de Polignac number, because 536152013 - 22 = 536152009 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 (536152003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14109245 + ... + 14109282.
It is an arithmetic number, because the mean of its divisors is an integer number (141092640).
Almost surely, 2536152013 is an apocalyptic number.
It is an amenable number.
536152013 is a deficient number, since it is larger than the sum of its proper divisors (28218547).
536152013 is a wasteful number, since it uses less digits than its factorization.
536152013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28218546.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 536152013 is about 23154.9565536194. The cubic root of 536152013 is about 812.3864048844.
The spelling of 536152013 in words is "five hundred thirty-six million, one hundred fifty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •