Base | Representation |
---|---|
bin | 10100111111000110011… |
… | …000010101011001011111 |
3 | 12002212102101012001121101 |
4 | 110333012120111121133 |
5 | 142112001412441111 |
6 | 3022302214413531 |
7 | 206122426252351 |
oct | 24770630253137 |
9 | 5085371161541 |
10 | 1442142312031 |
11 | 506677814043 |
12 | 1b35b66612a7 |
13 | a5cbb770295 |
14 | 4db2b5190d1 |
15 | 277a7c6abc1 |
hex | 14fc661565f |
1442142312031 has 16 divisors (see below), whose sum is σ = 1534843416960. Its totient is φ = 1351164624480.
The previous prime is 1442142311983. The next prime is 1442142312041. The reversal of 1442142312031 is 1302132412441.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1442142312031 - 213 = 1442142303839 is a prime.
It is a super-2 number, since 2×14421423120312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1442142312041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 589141 + ... + 1797601.
It is an arithmetic number, because the mean of its divisors is an integer number (95927713560).
Almost surely, 21442142312031 is an apocalyptic number.
1442142312031 is a deficient number, since it is larger than the sum of its proper divisors (92701104929).
1442142312031 is a wasteful number, since it uses less digits than its factorization.
1442142312031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1209174.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 1442142312031 its reverse (1302132412441), we get a palindrome (2744274724472).
The spelling of 1442142312031 in words is "one trillion, four hundred forty-two billion, one hundred forty-two million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •