Base | Representation |
---|---|
bin | 1111001110111011001110… |
… | …1000010010101110111101 |
3 | 2012022012022221222002102201 |
4 | 3303232303220102232331 |
5 | 4143404114314440021 |
6 | 55342232023351501 |
7 | 3346040043635341 |
oct | 363566350225675 |
9 | 65265287862381 |
10 | 16749091171261 |
11 | 5378282355689 |
12 | 1a661048b2591 |
13 | 946581329b87 |
14 | 41c935d79621 |
15 | 1e0a37b55591 |
hex | f3bb3a12bbd |
16749091171261 has 8 divisors (see below), whose sum is σ = 18068941863864. Its totient is φ = 15466419371520.
The previous prime is 16749091171223. The next prime is 16749091171297. The reversal of 16749091171261 is 16217119094761.
It can be written as a sum of positive squares in 4 ways, for example, as 2088079910361 + 14661011260900 = 1445019^2 + 3828970^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 16749091171261 - 213 = 16749091163069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16749091171201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9294722280 + ... + 9294724081.
It is an arithmetic number, because the mean of its divisors is an integer number (2258617732983).
Almost surely, 216749091171261 is an apocalyptic number.
It is an amenable number.
16749091171261 is a deficient number, since it is larger than the sum of its proper divisors (1319850692603).
16749091171261 is a wasteful number, since it uses less digits than its factorization.
16749091171261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18589446431.
The product of its (nonzero) digits is 1143072, while the sum is 55.
The spelling of 16749091171261 in words is "sixteen trillion, seven hundred forty-nine billion, ninety-one million, one hundred seventy-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •