Base | Representation |
---|---|
bin | 1000001110110011000… |
… | …1110011010000010011 |
3 | 111112000012120000200211 |
4 | 2003230301303100103 |
5 | 4304102311301233 |
6 | 144544041424551 |
7 | 13134210222532 |
oct | 2035461632023 |
9 | 445005500624 |
10 | 141411431443 |
11 | 54a77080507 |
12 | 234a649b157 |
13 | 10448113a29 |
14 | 6bb6c78319 |
15 | 3a29ac35cd |
hex | 20ecc73413 |
141411431443 has 4 divisors (see below), whose sum is σ = 141561710208. Its totient is φ = 141261152680.
The previous prime is 141411431431. The next prime is 141411431477. The reversal of 141411431443 is 344134114141.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 344134114141 = 57041 ⋅6033101.
It is a cyclic number.
It is not a de Polignac number, because 141411431443 - 233 = 132821496851 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (141411434443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75137971 + ... + 75139852.
It is an arithmetic number, because the mean of its divisors is an integer number (35390427552).
Almost surely, 2141411431443 is an apocalyptic number.
141411431443 is a deficient number, since it is larger than the sum of its proper divisors (150278765).
141411431443 is an equidigital number, since it uses as much as digits as its factorization.
141411431443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150278764.
The product of its digits is 9216, while the sum is 31.
Adding to 141411431443 its reverse (344134114141), we get a palindrome (485545545584).
The spelling of 141411431443 in words is "one hundred forty-one billion, four hundred eleven million, four hundred thirty-one thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •