Base | Representation |
---|---|
bin | 100000100011010011001001… |
… | …001011010111110111111111 |
3 | 200202220021022022100122002011 |
4 | 200203103021023113313333 |
5 | 122231041241112041223 |
6 | 1224252135551112051 |
7 | 42104126115066352 |
oct | 4043231113276777 |
9 | 622807268318064 |
10 | 143163225112063 |
11 | 41686201355552 |
12 | 14081baa512627 |
13 | 61b63076cbc40 |
14 | 274d1cc17c299 |
15 | 118400d8cb80d |
hex | 8234c92d7dff |
143163225112063 has 8 divisors (see below), whose sum is σ = 157936165790256. Its totient is φ = 128927482276800.
The previous prime is 143163225112001. The next prime is 143163225112081. The reversal of 143163225112063 is 360211522361341.
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 143163225112063 - 29 = 143163225111551 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 (143163225112163) 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, 134299460173 + ... + 134299461238.
It is an arithmetic number, because the mean of its divisors is an integer number (19742020723782).
Almost surely, 2143163225112063 is an apocalyptic number.
143163225112063 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
143163225112063 is a deficient number, since it is larger than the sum of its proper divisors (14772940678193).
143163225112063 is a wasteful number, since it uses less digits than its factorization.
143163225112063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268598921465.
The product of its (nonzero) digits is 155520, while the sum is 40.
The spelling of 143163225112063 in words is "one hundred forty-three trillion, one hundred sixty-three billion, two hundred twenty-five million, one hundred twelve thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •