Base | Representation |
---|---|
bin | 1000000100101010… |
… | …1010011010110010 |
3 | 12121000200212001012 |
4 | 2001022222122302 |
5 | 13414231243200 |
6 | 555011310522 |
7 | 104462446445 |
oct | 20112523262 |
9 | 5530625035 |
10 | 2167056050 |
11 | a12279315 |
12 | 5058ab442 |
13 | 286c686b3 |
14 | 167b4365c |
15 | ca3b0a35 |
hex | 812aa6b2 |
2167056050 has 24 divisors (see below), whose sum is σ = 4106780676. Its totient is φ = 850466240.
The previous prime is 2167056041. The next prime is 2167056053. The reversal of 2167056050 is 506507612.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 1431941281 + 735114769 = 37841^2 + 27113^2 .
It is a super-2 number, since 2×21670560502 = 9392263847683205000, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2167055998 and 2167056016.
It is not an unprimeable number, because it can be changed into a prime (2167056053) 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 11 ways as a sum of consecutive naturals, for example, 406229 + ... + 411528.
Almost surely, 22167056050 is an apocalyptic number.
2167056050 is a deficient number, since it is larger than the sum of its proper divisors (1939724626).
2167056050 is a wasteful number, since it uses less digits than its factorization.
2167056050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 817822 (or 817817 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 32.
The square root of 2167056050 is about 46551.6492726090. The cubic root of 2167056050 is about 1294.0668580639.
The spelling of 2167056050 in words is "two billion, one hundred sixty-seven million, fifty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •