Base | Representation |
---|---|
bin | 110010011000010010000100… |
… | …1100111110100000101111011 |
3 | 2011010000221222001112002111120 |
4 | 1210300210021213310011323 |
5 | 431040414310021200243 |
6 | 4210252343025200323 |
7 | 162224644630322145 |
oct | 14460441147640573 |
9 | 2133027861462446 |
10 | 443142002131323 |
11 | 119220516573470 |
12 | 4184ba7ba900a3 |
13 | 1603615ac49891 |
14 | 7b6028a0d9c95 |
15 | 3637218e44c83 |
hex | 19309099f417b |
443142002131323 has 32 divisors (see below), whose sum is σ = 644697223833600. Its totient is φ = 268517981702400.
The previous prime is 443142002131271. The next prime is 443142002131331. The reversal of 443142002131323 is 323131200241344.
It is not a de Polignac number, because 443142002131323 - 218 = 443142001869179 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (443142002131343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6336992623 + ... + 6337062551.
It is an arithmetic number, because the mean of its divisors is an integer number (20146788244800).
Almost surely, 2443142002131323 is an apocalyptic number.
443142002131323 is a deficient number, since it is larger than the sum of its proper divisors (201555221702277).
443142002131323 is a wasteful number, since it uses less digits than its factorization.
443142002131323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 105043.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 443142002131323 its reverse (323131200241344), we get a palindrome (766273202372667).
The spelling of 443142002131323 in words is "four hundred forty-three trillion, one hundred forty-two billion, two million, one hundred thirty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •