Base | Representation |
---|---|
bin | 1000010000000111… |
… | …0000101011010001 |
3 | 12201101000101220021 |
4 | 2010001300223101 |
5 | 14014023212113 |
6 | 1003444143441 |
7 | 105614435323 |
oct | 20401605321 |
9 | 5641011807 |
10 | 2215054033 |
11 | a37381975 |
12 | 519997b81 |
13 | 293ba277a |
14 | 170279613 |
15 | ce6e248d |
hex | 84070ad1 |
2215054033 has 2 divisors, whose sum is σ = 2215054034. Its totient is φ = 2215054032.
The previous prime is 2215054019. The next prime is 2215054043. The reversal of 2215054033 is 3304505122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1947633424 + 267420609 = 44132^2 + 16353^2 .
It is a cyclic number.
It is not a de Polignac number, because 2215054033 - 221 = 2212956881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2215053989 and 2215054007.
It is not a weakly prime, because it can be changed into another prime (2215054043) 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, 1107527016 + 1107527017.
It is an arithmetic number, because the mean of its divisors is an integer number (1107527017).
Almost surely, 22215054033 is an apocalyptic number.
It is an amenable number.
2215054033 is a deficient number, since it is larger than the sum of its proper divisors (1).
2215054033 is an equidigital number, since it uses as much as digits as its factorization.
2215054033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 2215054033 is about 47064.3605395845. The cubic root of 2215054033 is about 1303.5512433981.
Adding to 2215054033 its reverse (3304505122), we get a palindrome (5519559155).
The spelling of 2215054033 in words is "two billion, two hundred fifteen million, fifty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •