Base | Representation |
---|---|
bin | 1001011011100110… |
… | …1100000011100101 |
3 | 20112102211221110010 |
4 | 2112321230003211 |
5 | 20141104030221 |
6 | 1055115120433 |
7 | 116511065214 |
oct | 22671540345 |
9 | 6472757403 |
10 | 2531705061 |
11 | 108a099536 |
12 | 5a7a43119 |
13 | 314680542 |
14 | 1a034507b |
15 | ec3dec76 |
hex | 96e6c0e5 |
2531705061 has 8 divisors (see below), whose sum is σ = 3377237184. Its totient is φ = 1686988160.
The previous prime is 2531705053. The next prime is 2531705069. The reversal of 2531705061 is 1605071352.
2531705061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2531705053) and next prime (2531705069).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2531705061 - 23 = 2531705053 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2531705069) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196521 + ... + 209006.
It is an arithmetic number, because the mean of its divisors is an integer number (422154648).
Almost surely, 22531705061 is an apocalyptic number.
It is an amenable number.
2531705061 is a deficient number, since it is larger than the sum of its proper divisors (845532123).
2531705061 is a wasteful number, since it uses less digits than its factorization.
2531705061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407611.
The product of its (nonzero) digits is 6300, while the sum is 30.
The square root of 2531705061 is about 50316.0517230834. The cubic root of 2531705061 is about 1362.9221089368.
The spelling of 2531705061 in words is "two billion, five hundred thirty-one million, seven hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •