Base | Representation |
---|---|
bin | 1001010100001111110010… |
… | …1110010011101000100111 |
3 | 1100021021010002100202220012 |
4 | 2111003330232103220213 |
5 | 2320312032124444033 |
6 | 33441434452400435 |
7 | 2105031020434316 |
oct | 225037456235047 |
9 | 40237102322805 |
10 | 10243442031143 |
11 | 329a245a871a2 |
12 | 11952b801611b |
13 | 593c4c67ac69 |
14 | 275adc9aa27d |
15 | 12b6c715a248 |
hex | 950fcb93a27 |
10243442031143 has 8 divisors (see below), whose sum is σ = 10259552318400. Its totient is φ = 10227338316000.
The previous prime is 10243442031133. The next prime is 10243442031169. The reversal of 10243442031143 is 34113024434201.
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 10243442031143 - 26 = 10243442031079 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 (10243442031133) 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 7 ways as a sum of consecutive naturals, for example, 1481333 + ... + 4762481.
It is an arithmetic number, because the mean of its divisors is an integer number (1282444039800).
Almost surely, 210243442031143 is an apocalyptic number.
10243442031143 is a deficient number, since it is larger than the sum of its proper divisors (16110287257).
10243442031143 is an equidigital number, since it uses as much as digits as its factorization.
10243442031143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3286057.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 10243442031143 its reverse (34113024434201), we get a palindrome (44356466465344).
The spelling of 10243442031143 in words is "ten trillion, two hundred forty-three billion, four hundred forty-two million, thirty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •