Base | Representation |
---|---|
bin | 111111010011001… |
… | …1101101100001101 |
3 | 12111000201000010021 |
4 | 1332212131230031 |
5 | 13322221343201 |
6 | 550432542141 |
7 | 103430543455 |
oct | 17646355415 |
9 | 5430630107 |
10 | 2124012301 |
11 | 99aa49974 |
12 | 4b33b1951 |
13 | 27b077618 |
14 | 16213ad65 |
15 | c670bea1 |
hex | 7e99db0d |
2124012301 has 2 divisors, whose sum is σ = 2124012302. Its totient is φ = 2124012300.
The previous prime is 2124012281. The next prime is 2124012311. The reversal of 2124012301 is 1032104212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1269853225 + 854159076 = 35635^2 + 29226^2 .
It is a cyclic number.
It is not a de Polignac number, because 2124012301 - 211 = 2124010253 is a prime.
It is a super-2 number, since 2×21240123012 = 9022856509598629202, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2124012311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1062006150 + 1062006151.
It is an arithmetic number, because the mean of its divisors is an integer number (1062006151).
Almost surely, 22124012301 is an apocalyptic number.
It is an amenable number.
2124012301 is a deficient number, since it is larger than the sum of its proper divisors (1).
2124012301 is an equidigital number, since it uses as much as digits as its factorization.
2124012301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 2124012301 is about 46087.0079415013. The cubic root of 2124012301 is about 1285.4415760480.
Adding to 2124012301 its reverse (1032104212), we get a palindrome (3156116513).
The spelling of 2124012301 in words is "two billion, one hundred twenty-four million, twelve thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •