Base | Representation |
---|---|
bin | 111101101111111001001… |
… | …010101010011100100001 |
3 | 120000122201210002221211222 |
4 | 331233321022222130201 |
5 | 1024010301114340413 |
6 | 13005203500544425 |
7 | 615366152516105 |
oct | 75577112523441 |
9 | 16018653087758 |
10 | 4243313043233 |
11 | 1396640654270 |
12 | 586470b52115 |
13 | 24a1b1698274 |
14 | 10953da01905 |
15 | 755a1be3b08 |
hex | 3dbf92aa721 |
4243313043233 has 8 divisors (see below), whose sum is σ = 4727559600000. Its totient is φ = 3775481624080.
The previous prime is 4243313043223. The next prime is 4243313043257. The reversal of 4243313043233 is 3323403133424.
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 4243313043233 - 216 = 4243312977697 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 4243313043193 and 4243313043202.
It is not an unprimeable number, because it can be changed into a prime (4243313043223) 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, 4103783858 + ... + 4103784891.
It is an arithmetic number, because the mean of its divisors is an integer number (590944950000).
Almost surely, 24243313043233 is an apocalyptic number.
It is an amenable number.
4243313043233 is a deficient number, since it is larger than the sum of its proper divisors (484246556767).
4243313043233 is a wasteful number, since it uses less digits than its factorization.
4243313043233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8207568807.
The product of its (nonzero) digits is 186624, while the sum is 35.
Adding to 4243313043233 its reverse (3323403133424), we get a palindrome (7566716176657).
The spelling of 4243313043233 in words is "four trillion, two hundred forty-three billion, three hundred thirteen million, forty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •