Base | Representation |
---|---|
bin | 101000010101001001101… |
… | …011100001100100110111 |
3 | 100210221200220111012012210 |
4 | 220111021223201210313 |
5 | 330402002423134112 |
6 | 5521112134144503 |
7 | 404143051515246 |
oct | 50251153414467 |
9 | 10727626435183 |
10 | 2771490052407 |
11 | 979422977a1a |
12 | 3891724b2133 |
13 | 171472a6716b |
14 | 981d864095d |
15 | 4c15d3c7b3c |
hex | 28549ae1937 |
2771490052407 has 4 divisors (see below), whose sum is σ = 3695320069880. Its totient is φ = 1847660034936.
The previous prime is 2771490052381. The next prime is 2771490052417. The reversal of 2771490052407 is 7042500941772.
2771490052407 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2771490052407 - 26 = 2771490052343 is a prime.
It is a super-2 number, since 2×27714900524072 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2771490052417) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 461915008732 + ... + 461915008737.
It is an arithmetic number, because the mean of its divisors is an integer number (923830017470).
Almost surely, 22771490052407 is an apocalyptic number.
2771490052407 is a deficient number, since it is larger than the sum of its proper divisors (923830017473).
2771490052407 is an equidigital number, since it uses as much as digits as its factorization.
2771490052407 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 923830017472.
The product of its (nonzero) digits is 987840, while the sum is 48.
The spelling of 2771490052407 in words is "two trillion, seven hundred seventy-one billion, four hundred ninety million, fifty-two thousand, four hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •