Base | Representation |
---|---|
bin | 11110010110110000111… |
… | …00100010001000101111 |
3 | 10200201012101210210012212 |
4 | 33023120130202020233 |
5 | 114042042420203033 |
6 | 2115053113521035 |
7 | 135232562665166 |
oct | 17133034421057 |
9 | 3621171723185 |
10 | 1043013444143 |
11 | 372380997140 |
12 | 14a18711317b |
13 | 7748175ba38 |
14 | 386a6d1a3dd |
15 | 1c1e7a9a748 |
hex | f2d872222f |
1043013444143 has 8 divisors (see below), whose sum is σ = 1149563084880. Its totient is φ = 938418842880.
The previous prime is 1043013444139. The next prime is 1043013444199. The reversal of 1043013444143 is 3414443103401.
1043013444143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1043013444143 - 22 = 1043013444139 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 (1043013444043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 488758748 + ... + 488760881.
It is an arithmetic number, because the mean of its divisors is an integer number (143695385610).
Almost surely, 21043013444143 is an apocalyptic number.
1043013444143 is a deficient number, since it is larger than the sum of its proper divisors (106549640737).
1043013444143 is an equidigital number, since it uses as much as digits as its factorization.
1043013444143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 977519737.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 1043013444143 its reverse (3414443103401), we get a palindrome (4457456547544).
The spelling of 1043013444143 in words is "one trillion, forty-three billion, thirteen million, four hundred forty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •