Base | Representation |
---|---|
bin | 100000100111011000101001… |
… | …010001011110111111010011 |
3 | 200210220010001201001001012011 |
4 | 200213120221101132333103 |
5 | 122300141313102413133 |
6 | 1225025134002043351 |
7 | 42133326203006206 |
oct | 4047305121367723 |
9 | 623803051031164 |
10 | 143444010201043 |
11 | 417842991a97a2 |
12 | 141084b0949557 |
13 | 62069346b4ac6 |
14 | 275ca273a193d |
15 | 118b4941ed6cd |
hex | 82762945efd3 |
143444010201043 has 4 divisors (see below), whose sum is σ = 143502344489880. Its totient is φ = 143385675912208.
The previous prime is 143444010200993. The next prime is 143444010201067. The reversal of 143444010201043 is 340102010444341.
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 143444010201043 - 213 = 143444010192851 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 143444010200996 and 143444010201014.
It is not an unprimeable number, because it can be changed into a prime (143444010201343) 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, 29167140730 + ... + 29167145647.
It is an arithmetic number, because the mean of its divisors is an integer number (35875586122470).
Almost surely, 2143444010201043 is an apocalyptic number.
143444010201043 is a deficient number, since it is larger than the sum of its proper divisors (58334288837).
143444010201043 is an equidigital number, since it uses as much as digits as its factorization.
143444010201043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58334288836.
The product of its (nonzero) digits is 18432, while the sum is 31.
Adding to 143444010201043 its reverse (340102010444341), we get a palindrome (483546020645384).
The spelling of 143444010201043 in words is "one hundred forty-three trillion, four hundred forty-four billion, ten million, two hundred one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •