Base | Representation |
---|---|
bin | 10011011100110010… |
… | …01110001110011101 |
3 | 222221201112121022102 |
4 | 21232121032032131 |
5 | 132341130241341 |
6 | 4444053054445 |
7 | 516522606644 |
oct | 115631161635 |
9 | 28851477272 |
10 | 10442040221 |
11 | 4479294408 |
12 | 2035027425 |
13 | ca545b132 |
14 | 710b4c35b |
15 | 411ac7c9b |
hex | 26e64e39d |
10442040221 has 2 divisors, whose sum is σ = 10442040222. Its totient is φ = 10442040220.
The previous prime is 10442040209. The next prime is 10442040277. The reversal of 10442040221 is 12204024401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10401144196 + 40896025 = 101986^2 + 6395^2 .
It is an emirp because it is prime and its reverse (12204024401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10442040221 - 210 = 10442039197 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10442040193 and 10442040202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10442040421) 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, 5221020110 + 5221020111.
It is an arithmetic number, because the mean of its divisors is an integer number (5221020111).
Almost surely, 210442040221 is an apocalyptic number.
It is an amenable number.
10442040221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10442040221 is an equidigital number, since it uses as much as digits as its factorization.
10442040221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 10442040221 its reverse (12204024401), we get a palindrome (22646064622).
The spelling of 10442040221 in words is "ten billion, four hundred forty-two million, forty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •