Base | Representation |
---|---|
bin | 1001010101101010… |
… | …0011101010000111 |
3 | 20110200220221211121 |
4 | 2111122203222013 |
5 | 20113213020413 |
6 | 1052424414411 |
7 | 116056111360 |
oct | 22532435207 |
9 | 6420827747 |
10 | 2506766983 |
11 | 1077006156 |
12 | 59b617407 |
13 | 30c45b596 |
14 | 19acd2b67 |
15 | ea115b8d |
hex | 956a3a87 |
2506766983 has 8 divisors (see below), whose sum is σ = 2942305952. Its totient is φ = 2090585376.
The previous prime is 2506766971. The next prime is 2506767017. The reversal of 2506766983 is 3896676052.
2506766983 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2506766983 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2506766983.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2506766903) 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, 4839060 + ... + 4839577.
It is an arithmetic number, because the mean of its divisors is an integer number (367788244).
Almost surely, 22506766983 is an apocalyptic number.
2506766983 is a deficient number, since it is larger than the sum of its proper divisors (435538969).
2506766983 is an equidigital number, since it uses as much as digits as its factorization.
2506766983 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9678681.
The product of its (nonzero) digits is 3265920, while the sum is 52.
The square root of 2506766983 is about 50067.6240998112. The cubic root of 2506766983 is about 1358.4322662691.
The spelling of 2506766983 in words is "two billion, five hundred six million, seven hundred sixty-six thousand, nine hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •