Base | Representation |
---|---|
bin | 1000010101001000110… |
… | …1001100111010100101 |
3 | 111200101210120102022001 |
4 | 2011102031030322211 |
5 | 4321043424111003 |
6 | 145424550405301 |
7 | 13224322251145 |
oct | 2052215147245 |
9 | 450353512261 |
10 | 143113113253 |
11 | 5576a692210 |
12 | 238a0360831 |
13 | 1065982b946 |
14 | 6cd8c7a925 |
15 | 3ac91aa61d |
hex | 215234cea5 |
143113113253 has 4 divisors (see below), whose sum is σ = 156123396288. Its totient is φ = 130102830220.
The previous prime is 143113113251. The next prime is 143113113263. The reversal of 143113113253 is 352311311341.
It is a happy number.
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.
It is not a de Polignac number, because 143113113253 - 21 = 143113113251 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 (143113113251) 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, 6505141501 + ... + 6505141522.
It is an arithmetic number, because the mean of its divisors is an integer number (39030849072).
Almost surely, 2143113113253 is an apocalyptic number.
It is an amenable number.
143113113253 is a deficient number, since it is larger than the sum of its proper divisors (13010283035).
143113113253 is a wasteful number, since it uses less digits than its factorization.
143113113253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13010283034.
The product of its digits is 3240, while the sum is 28.
Adding to 143113113253 its reverse (352311311341), we get a palindrome (495424424594).
The spelling of 143113113253 in words is "one hundred forty-three billion, one hundred thirteen million, one hundred thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •