Base | Representation |
---|---|
bin | 1000011011000101… |
… | …1101000100001010 |
3 | 12211120200100020201 |
4 | 2012301131010022 |
5 | 14112321023200 |
6 | 1012211242414 |
7 | 110014061332 |
oct | 20661350412 |
9 | 5746610221 |
10 | 2261111050 |
11 | a6037a220 |
12 | 5312a940a |
13 | 2a05aa243 |
14 | 1764280c2 |
15 | d378dc6a |
hex | 86c5d10a |
2261111050 has 48 divisors (see below), whose sum is σ = 4699949184. Its totient is φ = 802160000.
The previous prime is 2261110997. The next prime is 2261111051. The reversal of 2261111050 is 501111622.
It is a super-2 number, since 2×22611110502 = 10225246360864205000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2261111051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 27586 + ... + 72685.
It is an arithmetic number, because the mean of its divisors is an integer number (97915608).
Almost surely, 22261111050 is an apocalyptic number.
2261111050 is an abundant number, since it is smaller than the sum of its proper divisors (2438838134).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2261111050 is a wasteful number, since it uses less digits than its factorization.
2261111050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100335 (or 100330 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 19.
The square root of 2261111050 is about 47551.1414163740. The cubic root of 2261111050 is about 1312.5241331919.
Adding to 2261111050 its reverse (501111622), we get a palindrome (2762222672).
It can be divided in two parts, 2261 and 111050, that added together give a palindrome (113311).
The spelling of 2261111050 in words is "two billion, two hundred sixty-one million, one hundred eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •