Base | Representation |
---|---|
bin | 101010111111101… |
… | …0100011011111101 |
3 | 10201112121211102011 |
4 | 1111333110123331 |
5 | 10423310142031 |
6 | 355053131221 |
7 | 50515266034 |
oct | 12577243375 |
9 | 3645554364 |
10 | 1442662141 |
11 | 680388468 |
12 | 343189b11 |
13 | 19cb67c4b |
14 | d985971b |
15 | 869c06b1 |
hex | 55fd46fd |
1442662141 has 2 divisors, whose sum is σ = 1442662142. Its totient is φ = 1442662140.
The previous prime is 1442662099. The next prime is 1442662147. The reversal of 1442662141 is 1412662441.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 779805625 + 662856516 = 27925^2 + 25746^2 .
It is an emirp because it is prime and its reverse (1412662441) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1442662141 - 215 = 1442629373 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1442662147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 721331070 + 721331071.
It is an arithmetic number, because the mean of its divisors is an integer number (721331071).
Almost surely, 21442662141 is an apocalyptic number.
It is an amenable number.
1442662141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1442662141 is an equidigital number, since it uses as much as digits as its factorization.
1442662141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 9216, while the sum is 31.
The square root of 1442662141 is about 37982.3925128473. The cubic root of 1442662141 is about 1129.9386869910.
It can be divided in two parts, 14426 and 62141, that added together give a palindrome (76567).
The spelling of 1442662141 in words is "one billion, four hundred forty-two million, six hundred sixty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •