Base | Representation |
---|---|
bin | 1111110001010010… |
… | …0001111111000001 |
3 | 101221000120220021200 |
4 | 3330110201333001 |
5 | 32132202144023 |
6 | 1540021011413 |
7 | 206621644035 |
oct | 37424417701 |
9 | 11830526250 |
10 | 4233240513 |
11 | 1882610287 |
12 | 9a1853b69 |
13 | 526046958 |
14 | 2c230a1c5 |
15 | 19b998743 |
hex | fc521fc1 |
4233240513 has 6 divisors (see below), whose sum is σ = 6114680754. Its totient is φ = 2822160336.
The previous prime is 4233240497. The next prime is 4233240523. The reversal of 4233240513 is 3150423324.
It can be written as a sum of positive squares in only one way, i.e., 3828144384 + 405096129 = 61872^2 + 20127^2 .
It is not a de Polignac number, because 4233240513 - 24 = 4233240497 is a prime.
It is not an unprimeable number, because it can be changed into a prime (4233240523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 235180020 + ... + 235180037.
It is an arithmetic number, because the mean of its divisors is an integer number (1019113459).
Almost surely, 24233240513 is an apocalyptic number.
It is an amenable number.
4233240513 is a deficient number, since it is larger than the sum of its proper divisors (1881440241).
4233240513 is a wasteful number, since it uses less digits than its factorization.
4233240513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 470360063 (or 470360060 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 27.
The square root of 4233240513 is about 65063.3576831076. The cubic root of 4233240513 is about 1617.6739101780.
Adding to 4233240513 its reverse (3150423324), we get a palindrome (7383663837).
The spelling of 4233240513 in words is "four billion, two hundred thirty-three million, two hundred forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •