Base | Representation |
---|---|
bin | 1001011110001000… |
… | …0011010011100111 |
3 | 20120011202111211210 |
4 | 2113202003103213 |
5 | 20201311123210 |
6 | 1100134002503 |
7 | 120000034461 |
oct | 22742032347 |
9 | 6504674753 |
10 | 2542286055 |
11 | 1095066161 |
12 | 5ab4a6433 |
13 | 31691669a |
14 | 1a18db131 |
15 | ed2cee20 |
hex | 978834e7 |
2542286055 has 8 divisors (see below), whose sum is σ = 4067657712. Its totient is φ = 1355885888.
The previous prime is 2542286027. The next prime is 2542286059. The reversal of 2542286055 is 5506822452.
It is a happy number.
2542286055 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2542286055 - 25 = 2542286023 is a prime.
It is a super-4 number, since 4×25422860554 (a number of 39 digits) contains 4444 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2542286059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84742854 + ... + 84742883.
It is an arithmetic number, because the mean of its divisors is an integer number (508457214).
Almost surely, 22542286055 is an apocalyptic number.
2542286055 is a deficient number, since it is larger than the sum of its proper divisors (1525371657).
2542286055 is a wasteful number, since it uses less digits than its factorization.
2542286055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 169485745.
The product of its (nonzero) digits is 192000, while the sum is 39.
The square root of 2542286055 is about 50421.0874039821. The cubic root of 2542286055 is about 1364.8181995663.
The spelling of 2542286055 in words is "two billion, five hundred forty-two million, two hundred eighty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •