Base | Representation |
---|---|
bin | 1000010110010000010… |
… | …1101000110101100001 |
3 | 111201011201002100200010 |
4 | 2011210011220311201 |
5 | 4322202224322403 |
6 | 145514424515133 |
7 | 13234624260336 |
oct | 2054405506541 |
9 | 451151070603 |
10 | 143413120353 |
11 | 55903a70a68 |
12 | 2396491baa9 |
13 | 106a6a2ca39 |
14 | 6d26a5298d |
15 | 3ae56bb603 |
hex | 2164168d61 |
143413120353 has 4 divisors (see below), whose sum is σ = 191217493808. Its totient is φ = 95608746900.
The previous prime is 143413120337. The next prime is 143413120363. The reversal of 143413120353 is 353021314341.
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 143413120353 - 24 = 143413120337 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 143413120353.
It is not an unprimeable number, because it can be changed into a prime (143413120363) 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, 23902186723 + ... + 23902186728.
It is an arithmetic number, because the mean of its divisors is an integer number (47804373452).
Almost surely, 2143413120353 is an apocalyptic number.
It is an amenable number.
143413120353 is a deficient number, since it is larger than the sum of its proper divisors (47804373455).
143413120353 is an equidigital number, since it uses as much as digits as its factorization.
143413120353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47804373454.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 143413120353 its reverse (353021314341), we get a palindrome (496434434694).
The spelling of 143413120353 in words is "one hundred forty-three billion, four hundred thirteen million, one hundred twenty thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •