Base | Representation |
---|---|
bin | 101000000110100101010… |
… | …101100011000010100101 |
3 | 100202110022210001211120221 |
4 | 220012211111203002211 |
5 | 330122434032112200 |
6 | 5510004041124341 |
7 | 403050323604043 |
oct | 50064525430245 |
9 | 10673283054527 |
10 | 2755847925925 |
11 | 972826344866 |
12 | 386127a896b1 |
13 | 16cb4c192b13 |
14 | 97553029393 |
15 | 4ba4502391a |
hex | 281a55630a5 |
2755847925925 has 48 divisors (see below), whose sum is σ = 3743819040960. Its totient is φ = 2003019791360.
The previous prime is 2755847925899. The next prime is 2755847926031. The reversal of 2755847925925 is 5295297485572.
2755847925925 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2755847925925 - 221 = 2755845828773 is a prime.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 66374022 + ... + 66415528.
It is an arithmetic number, because the mean of its divisors is an integer number (77996230020).
Almost surely, 22755847925925 is an apocalyptic number.
2755847925925 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2755847925925 is a deficient number, since it is larger than the sum of its proper divisors (987971115035).
2755847925925 is a wasteful number, since it uses less digits than its factorization.
2755847925925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46950 (or 46945 counting only the distinct ones).
The product of its digits is 635040000, while the sum is 70.
The spelling of 2755847925925 in words is "two trillion, seven hundred fifty-five billion, eight hundred forty-seven million, nine hundred twenty-five thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •