Base | Representation |
---|---|
bin | 11110011011100011100… |
… | …100011000111001111001 |
3 | 21101220200101012001002112 |
4 | 132123203210120321321 |
5 | 233230210022314311 |
6 | 4240400550542105 |
7 | 304040123224220 |
oct | 36334344307171 |
9 | 7356611161075 |
10 | 2091172073081 |
11 | 736952133813 |
12 | 299349367935 |
13 | 122273150600 |
14 | 732db2cbcb7 |
15 | 395e21ca28b |
hex | 1e6e3918e79 |
2091172073081 has 48 divisors (see below), whose sum is σ = 2635070699520. Its totient is φ = 1624460909760.
The previous prime is 2091172073063. The next prime is 2091172073087. The reversal of 2091172073081 is 1803702711902.
It is a happy number.
It is not a de Polignac number, because 2091172073081 - 214 = 2091172056697 is a prime.
It is a super-2 number, since 2×20911720730812 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2091172073087) 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 47 ways as a sum of consecutive naturals, for example, 56586896 + ... + 56623838.
It is an arithmetic number, because the mean of its divisors is an integer number (54897306240).
Almost surely, 22091172073081 is an apocalyptic number.
It is an amenable number.
2091172073081 is a deficient number, since it is larger than the sum of its proper divisors (543898626439).
2091172073081 is a wasteful number, since it uses less digits than its factorization.
2091172073081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37846 (or 37833 counting only the distinct ones).
The product of its (nonzero) digits is 42336, while the sum is 41.
Adding to 2091172073081 its reverse (1803702711902), we get a palindrome (3894874784983).
The spelling of 2091172073081 in words is "two trillion, ninety-one billion, one hundred seventy-two million, seventy-three thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •