Base | Representation |
---|---|
bin | 111101101110110… |
… | …0111101011001000 |
3 | 12100100122002211022 |
4 | 1323131213223020 |
5 | 13220232042443 |
6 | 541312252012 |
7 | 102221200664 |
oct | 17335475310 |
9 | 5310562738 |
10 | 2071362248 |
11 | 97325912a |
12 | 499841008 |
13 | 2701a1c47 |
14 | 1591538a4 |
15 | c1cabe68 |
hex | 7b767ac8 |
2071362248 has 12 divisors (see below), whose sum is σ = 3884045595. Its totient is φ = 1035616760.
The previous prime is 2071362211. The next prime is 2071362259. The reversal of 2071362248 is 8422631702.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in only one way, i.e., 1035681124 + 1035681124 = 32182^2 + 32182^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=32182.
It is a super-2 number, since 2×20713622482 = 8581083124879227008, which contains 22 as substring.
It is a Duffinian 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 2 ways as a sum of consecutive naturals, for example, 120683 + ... + 136773.
Almost surely, 22071362248 is an apocalyptic number.
It is an amenable number.
2071362248 is a deficient number, since it is larger than the sum of its proper divisors (1812683347).
2071362248 is an frugal number, since it uses more digits than its factorization.
2071362248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32188 (or 16093 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 35.
The square root of 2071362248 is about 45512.2208642909. The cubic root of 2071362248 is about 1274.7314052691.
The spelling of 2071362248 in words is "two billion, seventy-one million, three hundred sixty-two thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •