Base | Representation |
---|---|
bin | 10111100111100010011… |
… | …11000010111101000001 |
3 | 2212120121220111102000001 |
4 | 23303301033002331001 |
5 | 101243423240324321 |
6 | 1420444245000001 |
7 | 112425516403201 |
oct | 13636117027501 |
9 | 2776556442001 |
10 | 811501104961 |
11 | 293179244118 |
12 | 1113360b3001 |
13 | 5b6a7955021 |
14 | 2b3c39d8401 |
15 | 16197d66c91 |
hex | bcf13c2f41 |
811501104961 has 4 divisors (see below), whose sum is σ = 811586616624. Its totient is φ = 811415593300.
The previous prime is 811501104943. The next prime is 811501104977. The reversal of 811501104961 is 169401105118.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 811501104961 - 211 = 811501102913 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 811501104961.
It is not an unprimeable number, because it can be changed into a prime (811501104901) 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, 42741595 + ... + 42760576.
It is an arithmetic number, because the mean of its divisors is an integer number (202896654156).
Almost surely, 2811501104961 is an apocalyptic number.
It is an amenable number.
811501104961 is a deficient number, since it is larger than the sum of its proper divisors (85511663).
811501104961 is an equidigital number, since it uses as much as digits as its factorization.
811501104961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85511662.
The product of its (nonzero) digits is 8640, while the sum is 37.
The spelling of 811501104961 in words is "eight hundred eleven billion, five hundred one million, one hundred four thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •