Base | Representation |
---|---|
bin | 1111110001101110… |
… | …1111111000001000 |
3 | 101221011011000111110 |
4 | 3330123233320020 |
5 | 32133143214144 |
6 | 1540125330320 |
7 | 206644013565 |
oct | 37433577010 |
9 | 11834130443 |
10 | 4235132424 |
11 | 1883692746 |
12 | 9a24069a0 |
13 | 526559b23 |
14 | 2c267d86c |
15 | 19bc1e0b9 |
hex | fc6efe08 |
4235132424 has 64 divisors (see below), whose sum is σ = 10703067840. Its totient is φ = 1396398080.
The previous prime is 4235132401. The next prime is 4235132441. The reversal of 4235132424 is 4242315324.
It is a super-2 number, since 2×42351324242 = 35872693297632231552, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4235132391 and 4235132400.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1672039 + ... + 1674569.
It is an arithmetic number, because the mean of its divisors is an integer number (167235435).
Almost surely, 24235132424 is an apocalyptic number.
It is an amenable number.
4235132424 is an abundant number, since it is smaller than the sum of its proper divisors (6467935416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4235132424 is a wasteful number, since it uses less digits than its factorization.
4235132424 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3270 (or 3266 counting only the distinct ones).
The product of its digits is 23040, while the sum is 30.
The square root of 4235132424 is about 65077.8950489335. The cubic root of 4235132424 is about 1617.9148634335.
Adding to 4235132424 its reverse (4242315324), we get a palindrome (8477447748).
The spelling of 4235132424 in words is "four billion, two hundred thirty-five million, one hundred thirty-two thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •