Base | Representation |
---|---|
bin | 111111010011101… |
… | …1000101110000001 |
3 | 12111001011021210002 |
4 | 1332213120232001 |
5 | 13322302112311 |
6 | 550442045345 |
7 | 103432601405 |
oct | 17647305601 |
9 | 5431137702 |
10 | 2124254081 |
11 | 9a00a4594 |
12 | 4b34a9855 |
13 | 27b1306a1 |
14 | 1621a1105 |
15 | c675893b |
hex | 7e9d8b81 |
2124254081 has 2 divisors, whose sum is σ = 2124254082. Its totient is φ = 2124254080.
The previous prime is 2124254029. The next prime is 2124254107. The reversal of 2124254081 is 1804524212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1790643856 + 333610225 = 42316^2 + 18265^2 .
It is a cyclic number.
It is not a de Polignac number, because 2124254081 - 210 = 2124253057 is a prime.
It is a super-2 number, since 2×21242540812 = 9024910801290309122, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2124254281) 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, 1062127040 + 1062127041.
It is an arithmetic number, because the mean of its divisors is an integer number (1062127041).
Almost surely, 22124254081 is an apocalyptic number.
It is an amenable number.
2124254081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2124254081 is an equidigital number, since it uses as much as digits as its factorization.
2124254081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5120, while the sum is 29.
The square root of 2124254081 is about 46089.6309488371. The cubic root of 2124254081 is about 1285.4903488780.
Adding to 2124254081 its reverse (1804524212), we get a palindrome (3928778293).
The spelling of 2124254081 in words is "two billion, one hundred twenty-four million, two hundred fifty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •