Base | Representation |
---|---|
bin | 11111111111011… |
… | …000000101000101 |
3 | 1101101220120010202 |
4 | 133333120011011 |
5 | 2044344114042 |
6 | 125131300245 |
7 | 16204636412 |
oct | 3777300505 |
9 | 1341816122 |
10 | 536707397 |
11 | 255a59236 |
12 | 12b8aa685 |
13 | 87268055 |
14 | 513cd109 |
15 | 321b9632 |
hex | 1ffd8145 |
536707397 has 4 divisors (see below), whose sum is σ = 537947340. Its totient is φ = 535467456.
The previous prime is 536707373. The next prime is 536707417. The reversal of 536707397 is 793707635.
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 267944161 + 268763236 = 16369^2 + 16394^2 .
It is a cyclic number.
It is not a de Polignac number, because 536707397 - 26 = 536707333 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 (536701397) 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, 619322 + ... + 620187.
It is an arithmetic number, because the mean of its divisors is an integer number (134486835).
Almost surely, 2536707397 is an apocalyptic number.
It is an amenable number.
536707397 is a deficient number, since it is larger than the sum of its proper divisors (1239943).
536707397 is a wasteful number, since it uses less digits than its factorization.
536707397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1239942.
The product of its (nonzero) digits is 833490, while the sum is 47.
The square root of 536707397 is about 23166.9462165388. The cubic root of 536707397 is about 812.6668170930. Note that the first 3 decimals are identical.
The spelling of 536707397 in words is "five hundred thirty-six million, seven hundred seven thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •