Base | Representation |
---|---|
bin | 100000010100011110100… |
… | …100101111100010110001 |
3 | 21212022211002002222110012 |
4 | 200110132210233202301 |
5 | 242342112311243213 |
6 | 4420152434344305 |
7 | 316314503231513 |
oct | 40243644574261 |
9 | 7768732088405 |
10 | 2221011040433 |
11 | 786a1a915709 |
12 | 2ba54412b095 |
13 | 131595862643 |
14 | 796d7239bb3 |
15 | 3cb90d304a8 |
hex | 2051e92f8b1 |
2221011040433 has 2 divisors, whose sum is σ = 2221011040434. Its totient is φ = 2221011040432.
The previous prime is 2221011040399. The next prime is 2221011040447. The reversal of 2221011040433 is 3340401101222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2176250444944 + 44760595489 = 1475212^2 + 211567^2 .
It is a cyclic number.
It is not a de Polignac number, because 2221011040433 - 210 = 2221011039409 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2221011040399 and 2221011040408.
It is not a weakly prime, because it can be changed into another prime (2221011042433) 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, 1110505520216 + 1110505520217.
It is an arithmetic number, because the mean of its divisors is an integer number (1110505520217).
Almost surely, 22221011040433 is an apocalyptic number.
It is an amenable number.
2221011040433 is a deficient number, since it is larger than the sum of its proper divisors (1).
2221011040433 is an equidigital number, since it uses as much as digits as its factorization.
2221011040433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 2221011040433 its reverse (3340401101222), we get a palindrome (5561412141655).
The spelling of 2221011040433 in words is "two trillion, two hundred twenty-one billion, eleven million, forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •