Base | Representation |
---|---|
bin | 1111000110110101… |
… | …1010000110010011 |
3 | 101110121121010200011 |
4 | 3301231122012103 |
5 | 31301113244220 |
6 | 1510221135351 |
7 | 202330510531 |
oct | 36155320623 |
9 | 11417533604 |
10 | 4055212435 |
11 | 17a107513a |
12 | 9520ba557 |
13 | 4c81b34b1 |
14 | 2a6807151 |
15 | 18b02e65a |
hex | f1b5a193 |
4055212435 has 4 divisors (see below), whose sum is σ = 4866254928. Its totient is φ = 3244169944.
The previous prime is 4055212433. The next prime is 4055212493. The reversal of 4055212435 is 5342125504.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4055212435 - 21 = 4055212433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 4055212397 and 4055212406.
It is not an unprimeable number, because it can be changed into a prime (4055212433) 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 3 ways as a sum of consecutive naturals, for example, 405521239 + ... + 405521248.
It is an arithmetic number, because the mean of its divisors is an integer number (1216563732).
Almost surely, 24055212435 is an apocalyptic number.
4055212435 is a deficient number, since it is larger than the sum of its proper divisors (811042493).
4055212435 is an equidigital number, since it uses as much as digits as its factorization.
4055212435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811042492.
The product of its (nonzero) digits is 24000, while the sum is 31.
The square root of 4055212435 is about 63680.5498955529. The cubic root of 4055212435 is about 1594.6713925554.
Adding to 4055212435 its reverse (5342125504), we get a palindrome (9397337939).
The spelling of 4055212435 in words is "four billion, fifty-five million, two hundred twelve thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •