Base | Representation |
---|---|
bin | 1001110000000110… |
… | …10110101000000101 |
3 | 111111212021101012011 |
4 | 10320003112220011 |
5 | 41210223324001 |
6 | 2223300054221 |
7 | 243510625564 |
oct | 47003265005 |
9 | 14455241164 |
10 | 5235370501 |
11 | 2247259389 |
12 | 1021394371 |
13 | 65584b48a |
14 | 37944dbdb |
15 | 20994ad51 |
hex | 1380d6a05 |
5235370501 has 4 divisors (see below), whose sum is σ = 5235950412. Its totient is φ = 5234790592.
The previous prime is 5235370453. The next prime is 5235370571. The reversal of 5235370501 is 1050735325.
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 1393230276 + 3842140225 = 37326^2 + 61985^2 .
It is a cyclic number.
It is not a de Polignac number, because 5235370501 - 29 = 5235369989 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 (5235370571) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 276196 + ... + 294541.
It is an arithmetic number, because the mean of its divisors is an integer number (1308987603).
Almost surely, 25235370501 is an apocalyptic number.
It is an amenable number.
5235370501 is a deficient number, since it is larger than the sum of its proper divisors (579911).
5235370501 is an equidigital number, since it uses as much as digits as its factorization.
5235370501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 579910.
The product of its (nonzero) digits is 15750, while the sum is 31.
The square root of 5235370501 is about 72355.8601704105. The cubic root of 5235370501 is about 1736.3974546237.
The spelling of 5235370501 in words is "five billion, two hundred thirty-five million, three hundred seventy thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •