Base | Representation |
---|---|
bin | 1111110001101101… |
… | …0000100110011001 |
3 | 101221010220111202121 |
4 | 3330123100212121 |
5 | 32133130114223 |
6 | 1540122501241 |
7 | 206642641231 |
oct | 37433204631 |
9 | 11833814677 |
10 | 4235004313 |
11 | 1883605471 |
12 | 9a2364821 |
13 | 526513717 |
14 | 2c2648cc1 |
15 | 19bbe615d |
hex | fc6d0999 |
4235004313 has 2 divisors, whose sum is σ = 4235004314. Its totient is φ = 4235004312.
The previous prime is 4235004307. The next prime is 4235004337. The reversal of 4235004313 is 3134005324.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2927675664 + 1307328649 = 54108^2 + 36157^2 .
It is a cyclic number.
It is not a de Polignac number, because 4235004313 - 25 = 4235004281 is a prime.
It is a super-2 number, since 2×42350043132 = 35870523062257203938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (4235004353) 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 as a sum of consecutive naturals, namely, 2117502156 + 2117502157.
It is an arithmetic number, because the mean of its divisors is an integer number (2117502157).
Almost surely, 24235004313 is an apocalyptic number.
It is an amenable number.
4235004313 is a deficient number, since it is larger than the sum of its proper divisors (1).
4235004313 is an equidigital number, since it uses as much as digits as its factorization.
4235004313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 25.
The square root of 4235004313 is about 65076.9107518173. The cubic root of 4235004313 is about 1617.8985495177.
Adding to 4235004313 its reverse (3134005324), we get a palindrome (7369009637).
The spelling of 4235004313 in words is "four billion, two hundred thirty-five million, four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •