Base | Representation |
---|---|
bin | 111101100001010… |
… | …0100001011010000 |
3 | 12022212021210010122 |
4 | 1323002210023100 |
5 | 13211423120112 |
6 | 540500245412 |
7 | 102104001656 |
oct | 17302441320 |
9 | 5285253118 |
10 | 2064270032 |
11 | 96a2546a0 |
12 | 4973a0868 |
13 | 26b88aa76 |
14 | 158228dd6 |
15 | c135a872 |
hex | 7b0a42d0 |
2064270032 has 20 divisors (see below), whose sum is σ = 4363116576. Its totient is φ = 938304480.
The previous prime is 2064270011. The next prime is 2064270041. The reversal of 2064270032 is 2300724602.
It is a super-2 number, since 2×20642700322 = 8522421530026562048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2064269983 and 2064270010.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5864228 + ... + 5864579.
Almost surely, 22064270032 is an apocalyptic number.
2064270032 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2064270032 is an abundant number, since it is smaller than the sum of its proper divisors (2298846544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2064270032 is a wasteful number, since it uses less digits than its factorization.
2064270032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11728826 (or 11728820 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 26.
The square root of 2064270032 is about 45434.2385431956. The cubic root of 2064270032 is about 1273.2748745278.
Adding to 2064270032 its reverse (2300724602), we get a palindrome (4364994634).
The spelling of 2064270032 in words is "two billion, sixty-four million, two hundred seventy thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •