Base | Representation |
---|---|
bin | 1000010101100000111… |
… | …0100011011110111011 |
3 | 111200122211122122202221 |
4 | 2011120032203132323 |
5 | 4321300304144011 |
6 | 145442555504511 |
7 | 13226660013001 |
oct | 2053016433673 |
9 | 450584578687 |
10 | 143214131131 |
11 | 55811709465 |
12 | 2390a158137 |
13 | 1067473a836 |
14 | 6d08454a71 |
15 | 3ad2eb1971 |
hex | 21583a37bb |
143214131131 has 8 divisors (see below), whose sum is σ = 153959201280. Its totient is φ = 132789809448.
The previous prime is 143214131129. The next prime is 143214131171. The reversal of 143214131131 is 131131412341.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 143214131131 - 21 = 143214131129 is a prime.
It is a super-2 number, since 2×1432141311312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143214131096 and 143214131105.
It is not an unprimeable number, because it can be changed into a prime (143214131171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80186191 + ... + 80187976.
It is an arithmetic number, because the mean of its divisors is an integer number (19244900160).
Almost surely, 2143214131131 is an apocalyptic number.
143214131131 is a deficient number, since it is larger than the sum of its proper divisors (10745070149).
143214131131 is a wasteful number, since it uses less digits than its factorization.
143214131131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160374233.
The product of its digits is 864, while the sum is 25.
Adding to 143214131131 its reverse (131131412341), we get a palindrome (274345543472).
The spelling of 143214131131 in words is "one hundred forty-three billion, two hundred fourteen million, one hundred thirty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •