Base | Representation |
---|---|
bin | 101000010101101000001… |
… | …001001111110010010101 |
3 | 100211000000112020011111021 |
4 | 220111220021033302111 |
5 | 330404024244112331 |
6 | 5521234553041141 |
7 | 404161526044660 |
oct | 50255011176225 |
9 | 10730015204437 |
10 | 2772001160341 |
11 | 979665430976 |
12 | 3892956b61b1 |
13 | 17152490b1aa |
14 | 982464886d7 |
15 | 4c18d1d7211 |
hex | 2856824fc95 |
2772001160341 has 8 divisors (see below), whose sum is σ = 3169312061760. Its totient is φ = 2375017942848.
The previous prime is 2772001160237. The next prime is 2772001160351. The reversal of 2772001160341 is 1430611002772.
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 2772001160341 - 27 = 2772001160213 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2772001160297 and 2772001160306.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2772001160351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81902851 + ... + 81936688.
It is an arithmetic number, because the mean of its divisors is an integer number (396164007720).
Almost surely, 22772001160341 is an apocalyptic number.
It is an amenable number.
2772001160341 is a deficient number, since it is larger than the sum of its proper divisors (397310901419).
2772001160341 is a wasteful number, since it uses less digits than its factorization.
2772001160341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163841963.
The product of its (nonzero) digits is 14112, while the sum is 34.
The spelling of 2772001160341 in words is "two trillion, seven hundred seventy-two billion, one million, one hundred sixty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •