Base | Representation |
---|---|
bin | 1000010101100101001… |
… | …0110001010001011101 |
3 | 111200201002022011122101 |
4 | 2011121102301101131 |
5 | 4321314343412110 |
6 | 145444435045101 |
7 | 13230265011625 |
oct | 2053122612135 |
9 | 450632264571 |
10 | 143232013405 |
11 | 558208126a8 |
12 | 23914140791 |
13 | 1067835c070 |
14 | 6d0a98b885 |
15 | 3ad484513a |
hex | 21594b145d |
143232013405 has 16 divisors (see below), whose sum is σ = 191482588080. Its totient is φ = 102124044288.
The previous prime is 143232013403. The next prime is 143232013429. The reversal of 143232013405 is 504310232341.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 38611464004 + 104620549401 = 196498^2 + 323451^2 .
It is a cyclic number.
It is not a de Polignac number, because 143232013405 - 21 = 143232013403 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (143232013403) 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 15 ways as a sum of consecutive naturals, for example, 37990692 + ... + 37994461.
It is an arithmetic number, because the mean of its divisors is an integer number (11967661755).
Almost surely, 2143232013405 is an apocalyptic number.
It is an amenable number.
143232013405 is a deficient number, since it is larger than the sum of its proper divisors (48250574675).
143232013405 is a wasteful number, since it uses less digits than its factorization.
143232013405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75985200.
The product of its (nonzero) digits is 8640, while the sum is 28.
Adding to 143232013405 its reverse (504310232341), we get a palindrome (647542245746).
The spelling of 143232013405 in words is "one hundred forty-three billion, two hundred thirty-two million, thirteen thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •