Base | Representation |
---|---|
bin | 101011000000001… |
… | …0111011101000001 |
3 | 10201120010202221211 |
4 | 1112000113131001 |
5 | 10423342433031 |
6 | 355103050121 |
7 | 50520521236 |
oct | 12600273501 |
9 | 3646122854 |
10 | 1442936641 |
11 | 680555723 |
12 | 3432a0941 |
13 | 19cc32b83 |
14 | d98cb78d |
15 | 86a26bb1 |
hex | 56017741 |
1442936641 has 2 divisors, whose sum is σ = 1442936642. Its totient is φ = 1442936640.
The previous prime is 1442936629. The next prime is 1442936687. The reversal of 1442936641 is 1466392441.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 989417025 + 453519616 = 31455^2 + 21296^2 .
It is a cyclic number.
It is not a de Polignac number, because 1442936641 - 25 = 1442936609 is a prime.
It is a super-2 number, since 2×14429366412 = 4164132299880725762, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1442936594 and 1442936603.
It is not a weakly prime, because it can be changed into another prime (1442936611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 721468320 + 721468321.
It is an arithmetic number, because the mean of its divisors is an integer number (721468321).
Almost surely, 21442936641 is an apocalyptic number.
It is an amenable number.
1442936641 is a deficient number, since it is larger than the sum of its proper divisors (1).
1442936641 is an equidigital number, since it uses as much as digits as its factorization.
1442936641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 124416, while the sum is 40.
The square root of 1442936641 is about 37986.0058574207. The cubic root of 1442936641 is about 1130.0103481445.
The spelling of 1442936641 in words is "one billion, four hundred forty-two million, nine hundred thirty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •