Base | Representation |
---|---|
bin | 111111010110000… |
… | …1110011000110001 |
3 | 12111010112201200212 |
4 | 1332230032120301 |
5 | 13323113204411 |
6 | 550525153505 |
7 | 103446433355 |
oct | 17654163061 |
9 | 5433481625 |
10 | 2125522481 |
11 | 9a0890555 |
12 | 4b39bb895 |
13 | 27b485b14 |
14 | 162411465 |
15 | c690968b |
hex | 7eb0e631 |
2125522481 has 2 divisors, whose sum is σ = 2125522482. Its totient is φ = 2125522480.
The previous prime is 2125522463. The next prime is 2125522489. The reversal of 2125522481 is 1842255212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2125210000 + 312481 = 46100^2 + 559^2 .
It is a cyclic number.
It is not a de Polignac number, because 2125522481 - 222 = 2121328177 is a prime.
It is a super-2 number, since 2×21255224812 = 9035691634472790722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2125522489) 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 as a sum of consecutive naturals, namely, 1062761240 + 1062761241.
It is an arithmetic number, because the mean of its divisors is an integer number (1062761241).
Almost surely, 22125522481 is an apocalyptic number.
It is an amenable number.
2125522481 is a deficient number, since it is larger than the sum of its proper divisors (1).
2125522481 is an equidigital number, since it uses as much as digits as its factorization.
2125522481 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12800, while the sum is 32.
The square root of 2125522481 is about 46103.3890402864. The cubic root of 2125522481 is about 1285.7461549908.
Adding to 2125522481 its reverse (1842255212), we get a palindrome (3967777693).
The spelling of 2125522481 in words is "two billion, one hundred twenty-five million, five hundred twenty-two thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •