Base | Representation |
---|---|
bin | 11101000111010110111… |
… | …101110011001110000001 |
3 | 21002021022211210210212112 |
4 | 131013112331303032001 |
5 | 230240032134124231 |
6 | 4131050033505105 |
7 | 264356566044503 |
oct | 35072675631601 |
9 | 7067284723775 |
10 | 2000766317441 |
11 | 70157a476491 |
12 | 283918712195 |
13 | 116896253048 |
14 | 6cba256bd73 |
15 | 370a03ee92b |
hex | 1d1d6f73381 |
2000766317441 has 8 divisors (see below), whose sum is σ = 2003660934504. Its totient is φ = 1997872398720.
The previous prime is 2000766317383. The next prime is 2000766317477. The reversal of 2000766317441 is 1447136670002.
It can be written as a sum of positive squares in 4 ways, for example, as 88920854416 + 1911845463025 = 298196^2 + 1382695^2 .
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 2000766317441 - 222 = 2000762123137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2000766317041) 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 7 ways as a sum of consecutive naturals, for example, 5702291 + ... + 6042983.
It is an arithmetic number, because the mean of its divisors is an integer number (250457616813).
Almost surely, 22000766317441 is an apocalyptic number.
It is an amenable number.
2000766317441 is a deficient number, since it is larger than the sum of its proper divisors (2894617063).
2000766317441 is an equidigital number, since it uses as much as digits as its factorization.
2000766317441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349171.
The product of its (nonzero) digits is 169344, while the sum is 41.
The spelling of 2000766317441 in words is "two trillion, seven hundred sixty-six million, three hundred seventeen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •