Base | Representation |
---|---|
bin | 11101101101011101011… |
… | …101000100010001010001 |
3 | 21020011221000011102112022 |
4 | 131231131131010101101 |
5 | 231422323401210403 |
6 | 4201533355341225 |
7 | 300335445162542 |
oct | 35553535042121 |
9 | 7204830142468 |
10 | 2041677366353 |
11 | 717963713009 |
12 | 28b835751815 |
13 | 11a6b5c9a0b1 |
14 | 70b63b304c9 |
15 | 38196d96d38 |
hex | 1db5d744451 |
2041677366353 has 4 divisors (see below), whose sum is σ = 2161776034980. Its totient is φ = 1921578697728.
The previous prime is 2041677366349. The next prime is 2041677366361. The reversal of 2041677366353 is 3536637761402.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1904819543104 + 136857823249 = 1380152^2 + 369943^2 .
It is a cyclic number.
It is not a de Polignac number, because 2041677366353 - 22 = 2041677366349 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2041677366295 and 2041677366304.
It is not an unprimeable number, because it can be changed into a prime (2041677360353) 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, 60049334288 + ... + 60049334321.
It is an arithmetic number, because the mean of its divisors is an integer number (540444008745).
Almost surely, 22041677366353 is an apocalyptic number.
It is an amenable number.
2041677366353 is a deficient number, since it is larger than the sum of its proper divisors (120098668627).
2041677366353 is a wasteful number, since it uses less digits than its factorization.
2041677366353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120098668626.
The product of its (nonzero) digits is 11430720, while the sum is 53.
The spelling of 2041677366353 in words is "two trillion, forty-one billion, six hundred seventy-seven million, three hundred sixty-six thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •