Base | Representation |
---|---|
bin | 11101111110010101011… |
… | …111000000001110100001 |
3 | 21021220200210221202211001 |
4 | 131332111133000032201 |
5 | 232221431100023421 |
6 | 4214131403552001 |
7 | 301546460614351 |
oct | 35762537001641 |
9 | 7256623852731 |
10 | 2059797267361 |
11 | 724611949909 |
12 | 293251b2b601 |
13 | 11c312cbb502 |
14 | 719a244cb61 |
15 | 388a7a36691 |
hex | 1df957c03a1 |
2059797267361 has 4 divisors (see below), whose sum is σ = 2059818709572. Its totient is φ = 2059775825152.
The previous prime is 2059797267347. The next prime is 2059797267383. The reversal of 2059797267361 is 1637627979502.
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 228766107025 + 1831031160336 = 478295^2 + 1353156^2 .
It is a cyclic number.
It is not a de Polignac number, because 2059797267361 - 211 = 2059797265313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2059797267293 and 2059797267302.
It is not an unprimeable number, because it can be changed into a prime (2059797267961) 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, 10576360 + ... + 10769353.
It is an arithmetic number, because the mean of its divisors is an integer number (514954677393).
Almost surely, 22059797267361 is an apocalyptic number.
It is an amenable number.
2059797267361 is a deficient number, since it is larger than the sum of its proper divisors (21442211).
2059797267361 is an equidigital number, since it uses as much as digits as its factorization.
2059797267361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21442210.
The product of its (nonzero) digits is 60011280, while the sum is 64.
The spelling of 2059797267361 in words is "two trillion, fifty-nine billion, seven hundred ninety-seven million, two hundred sixty-seven thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •