Base | Representation |
---|---|
bin | 111101101111111001110… |
… | …100110101111000101111 |
3 | 120000122202112220201002011 |
4 | 331233321310311320233 |
5 | 1024010311432201033 |
6 | 13005204533542051 |
7 | 615366345510022 |
oct | 75577164657057 |
9 | 16018675821064 |
10 | 4243324100143 |
11 | 1396646916507 |
12 | 5864747a4927 |
13 | 24a1b3a69c0b |
14 | 10954127d1b9 |
15 | 755a2b79ccd |
hex | 3dbf9d35e2f |
4243324100143 has 8 divisors (see below), whose sum is σ = 4358049000912. Its totient is φ = 4128601329216.
The previous prime is 4243324100129. The next prime is 4243324100159. The reversal of 4243324100143 is 3410014233424.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4243324100143 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 (4243324103143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4026696 + ... + 4970002.
It is an arithmetic number, because the mean of its divisors is an integer number (544756125114).
Almost surely, 24243324100143 is an apocalyptic number.
4243324100143 is a deficient number, since it is larger than the sum of its proper divisors (114724900769).
4243324100143 is a wasteful number, since it uses less digits than its factorization.
4243324100143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1064921.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 4243324100143 its reverse (3410014233424), we get a palindrome (7653338333567).
The spelling of 4243324100143 in words is "four trillion, two hundred forty-three billion, three hundred twenty-four million, one hundred thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •