Base | Representation |
---|---|
bin | 1000010101111010001… |
… | …0100101000111101011 |
3 | 111200221012221120221012 |
4 | 2011132202211013223 |
5 | 4322004412402021 |
6 | 145501301534135 |
7 | 13232414162624 |
oct | 2053642450753 |
9 | 450835846835 |
10 | 143320044011 |
11 | 55866479371 |
12 | 2393971434b |
13 | 10690671791 |
14 | 6d18544a4b |
15 | 3adc43335b |
hex | 215e8a51eb |
143320044011 has 4 divisors (see below), whose sum is σ = 147193558752. Its totient is φ = 139446529272.
The previous prime is 143320043987. The next prime is 143320044013. The reversal of 143320044011 is 110440023341.
143320044011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 143320044011 - 222 = 143315849707 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (143320044013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1936757315 + ... + 1936757388.
It is an arithmetic number, because the mean of its divisors is an integer number (36798389688).
Almost surely, 2143320044011 is an apocalyptic number.
143320044011 is a deficient number, since it is larger than the sum of its proper divisors (3873514741).
143320044011 is an equidigital number, since it uses as much as digits as its factorization.
143320044011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3873514740.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 143320044011 its reverse (110440023341), we get a palindrome (253760067352).
The spelling of 143320044011 in words is "one hundred forty-three billion, three hundred twenty million, forty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •