Base | Representation |
---|---|
bin | 111101111011011… |
… | …0000100101100001 |
3 | 12100211000220202021 |
4 | 1323312300211201 |
5 | 13223423433403 |
6 | 542105421441 |
7 | 102331206061 |
oct | 17366604541 |
9 | 5324026667 |
10 | 2077952353 |
11 | 976a4a3a4 |
12 | 49ba9a881 |
13 | 27166b709 |
14 | 159d8b3a1 |
15 | c265e8bd |
hex | 7bdb0961 |
2077952353 has 4 divisors (see below), whose sum is σ = 2078662320. Its totient is φ = 2077242388.
The previous prime is 2077952321. The next prime is 2077952407. The reversal of 2077952353 is 3532597702.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3532597702 = 2 ⋅1766298851.
It is a cyclic number.
It is not a de Polignac number, because 2077952353 - 25 = 2077952321 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2077950353) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 350575 + ... + 356452.
It is an arithmetic number, because the mean of its divisors is an integer number (519665580).
Almost surely, 22077952353 is an apocalyptic number.
It is an amenable number.
2077952353 is a deficient number, since it is larger than the sum of its proper divisors (709967).
2077952353 is an equidigital number, since it uses as much as digits as its factorization.
2077952353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 709966.
The product of its (nonzero) digits is 396900, while the sum is 43.
The square root of 2077952353 is about 45584.5626610588. The cubic root of 2077952353 is about 1276.0818403252.
The spelling of 2077952353 in words is "two billion, seventy-seven million, nine hundred fifty-two thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •