Base | Representation |
---|---|
bin | 1000010010111110… |
… | …1111001011111100 |
3 | 12202012200201212000 |
4 | 2010233233023330 |
5 | 14030114402211 |
6 | 1004554342300 |
7 | 106122044013 |
oct | 20457571374 |
9 | 5665621760 |
10 | 2227106556 |
11 | a43164134 |
12 | 521a2a990 |
13 | 29653263c |
14 | 171ad5a7a |
15 | d07c3656 |
hex | 84bef2fc |
2227106556 has 48 divisors (see below), whose sum is σ = 6113630880. Its totient is φ = 698699520.
The previous prime is 2227106549. The next prime is 2227106561. The reversal of 2227106556 is 6556017222.
It is a super-2 number, since 2×22271065562 = 9920007223556362272, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2227106556.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 604675 + ... + 608346.
It is an arithmetic number, because the mean of its divisors is an integer number (127367310).
Almost surely, 22227106556 is an apocalyptic number.
It is an amenable number.
2227106556 is an abundant number, since it is smaller than the sum of its proper divisors (3886524324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2227106556 is a wasteful number, since it uses less digits than its factorization.
2227106556 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1213051 (or 1213043 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 2227106556 is about 47192.2298265297. The cubic root of 2227106556 is about 1305.9112567873.
The spelling of 2227106556 in words is "two billion, two hundred twenty-seven million, one hundred six thousand, five hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •