Base | Representation |
---|---|
bin | 100101001100111101010… |
… | …111101010010001101011 |
3 | 100001101212022220221110201 |
4 | 211030331113222101223 |
5 | 313341240444410041 |
6 | 5234242300453031 |
7 | 352463216154544 |
oct | 45147527522153 |
9 | 10041768827421 |
10 | 2556535153771 |
11 | 8a624749a065 |
12 | 35358254a177 |
13 | 157107360751 |
14 | 8ba463194cb |
15 | 4677c09c631 |
hex | 2533d5ea46b |
2556535153771 has 8 divisors (see below), whose sum is σ = 2559805934400. Its totient is φ = 2553264648000.
The previous prime is 2556535153741. The next prime is 2556535153819. The reversal of 2556535153771 is 1773515356552.
2556535153771 is digitally balanced in base 3, because in such base 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 2556535153771 - 213 = 2556535145579 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2556535153721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23812750 + ... + 23919868.
It is an arithmetic number, because the mean of its divisors is an integer number (319975741800).
Almost surely, 22556535153771 is an apocalyptic number.
2556535153771 is a deficient number, since it is larger than the sum of its proper divisors (3270780629).
2556535153771 is a wasteful number, since it uses less digits than its factorization.
2556535153771 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137429.
The product of its digits is 16537500, while the sum is 55.
The spelling of 2556535153771 in words is "two trillion, five hundred fifty-six billion, five hundred thirty-five million, one hundred fifty-three thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •