Base | Representation |
---|---|
bin | 10100111110111110000… |
… | …100111111001001011111 |
3 | 12002212001200002102012022 |
4 | 110332332010333021133 |
5 | 142111210233204211 |
6 | 3022240321130355 |
7 | 206116115311256 |
oct | 24767604771137 |
9 | 5085050072168 |
10 | 1442003022431 |
11 | 506606127774 |
12 | 1b3577a899bb |
13 | a5c989513ba |
14 | 4db16c1b79d |
15 | 2779a904bdb |
hex | 14fbe13f25f |
1442003022431 has 2 divisors, whose sum is σ = 1442003022432. Its totient is φ = 1442003022430.
The previous prime is 1442003022377. The next prime is 1442003022433. The reversal of 1442003022431 is 1342203002441.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1442003022431 - 218 = 1442002760287 is a prime.
It is a super-2 number, since 2×14420030224312 (a number of 25 digits) contains 22 as substring.
Together with 1442003022433, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1442003022431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1442003022433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 721001511215 + 721001511216.
It is an arithmetic number, because the mean of its divisors is an integer number (721001511216).
Almost surely, 21442003022431 is an apocalyptic number.
1442003022431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1442003022431 is an equidigital number, since it uses as much as digits as its factorization.
1442003022431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4608, while the sum is 26.
Adding to 1442003022431 its reverse (1342203002441), we get a palindrome (2784206024872).
The spelling of 1442003022431 in words is "one trillion, four hundred forty-two billion, three million, twenty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •