Base | Representation |
---|---|
bin | 1001010101100000… |
… | …0001000100110001 |
3 | 20110122200010100002 |
4 | 2111120001010301 |
5 | 20113030213131 |
6 | 1052402235345 |
7 | 116050336013 |
oct | 22530010461 |
9 | 6418603302 |
10 | 2506101041 |
11 | 10766a0894 |
12 | 59b355b55 |
13 | 30c287432 |
14 | 19ab9c1b3 |
15 | ea0336cb |
hex | 95601131 |
2506101041 has 2 divisors, whose sum is σ = 2506101042. Its totient is φ = 2506101040.
The previous prime is 2506101001. The next prime is 2506101061. The reversal of 2506101041 is 1401016052.
It is an a-pointer prime, because the next prime (2506101061) can be obtained adding 2506101041 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1513599025 + 992502016 = 38905^2 + 31504^2 .
It is a cyclic number.
It is not a de Polignac number, because 2506101041 - 218 = 2505838897 is a prime.
It is not a weakly prime, because it can be changed into another prime (2506101001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1253050520 + 1253050521.
It is an arithmetic number, because the mean of its divisors is an integer number (1253050521).
Almost surely, 22506101041 is an apocalyptic number.
It is an amenable number.
2506101041 is a deficient number, since it is larger than the sum of its proper divisors (1).
2506101041 is an equidigital number, since it uses as much as digits as its factorization.
2506101041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 2506101041 is about 50060.9732326490. The cubic root of 2506101041 is about 1358.3119629426.
Adding to 2506101041 its reverse (1401016052), we get a palindrome (3907117093).
The spelling of 2506101041 in words is "two billion, five hundred six million, one hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •