Base | Representation |
---|---|
bin | 100111111010001011001… |
… | …100110011001010001111 |
3 | 100201011221020201211220221 |
4 | 213322023030303022033 |
5 | 324413142234220101 |
6 | 5455522014252211 |
7 | 402066212546140 |
oct | 47721314631217 |
9 | 10634836654827 |
10 | 2742524523151 |
11 | 968109661096 |
12 | 383629ab7067 |
13 | 16b807abb13a |
14 | 96a4b757ac7 |
15 | 4b5154ddaa1 |
hex | 27e8b33328f |
2742524523151 has 4 divisors (see below), whose sum is σ = 3134313740752. Its totient is φ = 2350735305552.
The previous prime is 2742524523131. The next prime is 2742524523163. The reversal of 2742524523151 is 1513254252472.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2742524523151 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2742524523098 and 2742524523107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2742524523131) 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 3 ways as a sum of consecutive naturals, for example, 195894608790 + ... + 195894608803.
It is an arithmetic number, because the mean of its divisors is an integer number (783578435188).
Almost surely, 22742524523151 is an apocalyptic number.
2742524523151 is a deficient number, since it is larger than the sum of its proper divisors (391789217601).
2742524523151 is an equidigital number, since it uses as much as digits as its factorization.
2742524523151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391789217600.
The product of its digits is 672000, while the sum is 43.
The spelling of 2742524523151 in words is "two trillion, seven hundred forty-two billion, five hundred twenty-four million, five hundred twenty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •