Base | Representation |
---|---|
bin | 1000010101001101010… |
… | …1010111100110110101 |
3 | 111200110010011120010122 |
4 | 2011103111113212311 |
5 | 4321113300001123 |
6 | 145430504101325 |
7 | 13224642123140 |
oct | 2052325274665 |
9 | 450403146118 |
10 | 143132031413 |
11 | 5577a333758 |
12 | 238a6764845 |
13 | 10660723817 |
14 | 6cdb5a3057 |
15 | 3acab95bc8 |
hex | 21535579b5 |
143132031413 has 4 divisors (see below), whose sum is σ = 163579464480. Its totient is φ = 122684598348.
The previous prime is 143132031401. The next prime is 143132031431. The reversal of 143132031413 is 314130231341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 314130231341 = 53 ⋅5926985497.
It is a cyclic number.
It is not a de Polignac number, because 143132031413 - 214 = 143132015029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143132031433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10223716523 + ... + 10223716536.
It is an arithmetic number, because the mean of its divisors is an integer number (40894866120).
Almost surely, 2143132031413 is an apocalyptic number.
It is an amenable number.
143132031413 is a deficient number, since it is larger than the sum of its proper divisors (20447433067).
143132031413 is an equidigital number, since it uses as much as digits as its factorization.
143132031413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20447433066.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 143132031413 its reverse (314130231341), we get a palindrome (457262262754).
The spelling of 143132031413 in words is "one hundred forty-three billion, one hundred thirty-two million, thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •