Base | Representation |
---|---|
bin | 100000111001110000010… |
… | …011111010001110010111 |
3 | 22000011010120010201002122 |
4 | 200321300103322032113 |
5 | 244021100442040421 |
6 | 4450412303130155 |
7 | 322232414643146 |
oct | 40716023721627 |
9 | 8004116121078 |
10 | 2261037065111 |
11 | 7a199a529450 |
12 | 3062548a395b |
13 | 1352a4127606 |
14 | 7b61305d75d |
15 | 3dc34c582ab |
hex | 20e704fa397 |
2261037065111 has 4 divisors (see below), whose sum is σ = 2466585889224. Its totient is φ = 2055488241000.
The previous prime is 2261037065107. The next prime is 2261037065123. The reversal of 2261037065111 is 1115607301622.
It is a happy number.
2261037065111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2261037065111 - 22 = 2261037065107 is a prime.
It is a super-2 number, since 2×22610370651112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2261037065101) 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, 102774412040 + ... + 102774412061.
It is an arithmetic number, because the mean of its divisors is an integer number (616646472306).
Almost surely, 22261037065111 is an apocalyptic number.
2261037065111 is a deficient number, since it is larger than the sum of its proper divisors (205548824113).
2261037065111 is a wasteful number, since it uses less digits than its factorization.
2261037065111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205548824112.
The product of its (nonzero) digits is 15120, while the sum is 35.
The spelling of 2261037065111 in words is "two trillion, two hundred sixty-one billion, thirty-seven million, sixty-five thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •