Base | Representation |
---|---|
bin | 111011010111100001011101… |
… | …100110000000000010101011 |
3 | 1021020111000220002200111220102 |
4 | 323113201131212000002223 |
5 | 233210340300324214123 |
6 | 2323152125011220015 |
7 | 105665640455006033 |
oct | 7327413546000253 |
9 | 1236430802614812 |
10 | 261101222101163 |
11 | 76216451a88104 |
12 | 2534b1baba760b |
13 | b28c97cb77702 |
14 | 486951bc688c3 |
15 | 202bc96a47028 |
hex | ed785d9800ab |
261101222101163 has 16 divisors (see below), whose sum is σ = 267817783083264. Its totient is φ = 254471314389600.
The previous prime is 261101222101063. The next prime is 261101222101201. The reversal of 261101222101163 is 361101222101162.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 261101222101163 - 210 = 261101222100139 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (261101222101063) 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 15 ways as a sum of consecutive naturals, for example, 4862345 + ... + 23363322.
It is an arithmetic number, because the mean of its divisors is an integer number (16738611442704).
Almost surely, 2261101222101163 is an apocalyptic number.
261101222101163 is a deficient number, since it is larger than the sum of its proper divisors (6716560982101).
261101222101163 is a wasteful number, since it uses less digits than its factorization.
261101222101163 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28227202.
The product of its (nonzero) digits is 1728, while the sum is 29.
Subtracting 261101222101163 from its reverse (361101222101162), we obtain a palindrome (99999999999999).
The spelling of 261101222101163 in words is "two hundred sixty-one trillion, one hundred one billion, two hundred twenty-two million, one hundred one thousand, one hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •