Base | Representation |
---|---|
bin | 1000000000110110… |
… | …00001111100001101 |
3 | 102002211001221110020 |
4 | 10000123001330031 |
5 | 32302311200013 |
6 | 1550515532353 |
7 | 211415563650 |
oct | 40033017415 |
9 | 12084057406 |
10 | 4302053133 |
11 | 1908440214 |
12 | a008ba0b9 |
13 | 53738ab91 |
14 | 2cb4dd897 |
15 | 1a2a3c623 |
hex | 1006c1f0d |
4302053133 has 24 divisors (see below), whose sum is σ = 6963820992. Its totient is φ = 2313705984.
The previous prime is 4302053113. The next prime is 4302053141. The reversal of 4302053133 is 3313502034.
It is a happy number.
It is not a de Polignac number, because 4302053133 - 210 = 4302052109 is a prime.
It is a super-2 number, since 2×43020531332 = 37015322318310231378, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4302053113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 348360 + ... + 360497.
It is an arithmetic number, because the mean of its divisors is an integer number (290159208).
Almost surely, 24302053133 is an apocalyptic number.
It is an amenable number.
4302053133 is a deficient number, since it is larger than the sum of its proper divisors (2661767859).
4302053133 is a wasteful number, since it uses less digits than its factorization.
4302053133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708901 (or 708884 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 24.
The square root of 4302053133 is about 65590.0383671179. The cubic root of 4302053133 is about 1626.3921019716.
Adding to 4302053133 its reverse (3313502034), we get a palindrome (7615555167).
The spelling of 4302053133 in words is "four billion, three hundred two million, fifty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •