Base | Representation |
---|---|
bin | 10000100100010110010110… |
… | …010000010110001011000001 |
3 | 100112222222112111111011110002 |
4 | 100210112112100112023001 |
5 | 34022321340101403121 |
6 | 414550250041445345 |
7 | 21230304202332446 |
oct | 2044262620261301 |
9 | 315888474434402 |
10 | 72866641044161 |
11 | 21243629270508 |
12 | 820a0627a0855 |
13 | 31873aa7aa143 |
14 | 13dca9b12b9cd |
15 | 865666579e0b |
hex | 4245964162c1 |
72866641044161 has 8 divisors (see below), whose sum is σ = 76035456048384. Its totient is φ = 69697884388000.
The previous prime is 72866641044059. The next prime is 72866641044173. The reversal of 72866641044161 is 16144014666827.
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 72866641044161 - 222 = 72866636849857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 72866641044097 and 72866641044106.
It is not an unprimeable number, because it can be changed into a prime (72866641044191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12025481 + ... + 17039526.
It is an arithmetic number, because the mean of its divisors is an integer number (9504432006048).
Almost surely, 272866641044161 is an apocalyptic number.
It is an amenable number.
72866641044161 is a deficient number, since it is larger than the sum of its proper divisors (3168815004223).
72866641044161 is a wasteful number, since it uses less digits than its factorization.
72866641044161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29174031.
The product of its (nonzero) digits is 9289728, while the sum is 56.
The spelling of 72866641044161 in words is "seventy-two trillion, eight hundred sixty-six billion, six hundred forty-one million, forty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •