Base | Representation |
---|---|
bin | 111111011101010… |
… | …110110100001000 |
3 | 2202012100100021110 |
4 | 333131112310020 |
5 | 4140023111412 |
6 | 253351210320 |
7 | 35245314456 |
oct | 7735266410 |
9 | 2665310243 |
10 | 1064660232 |
11 | 4a6a77a99 |
12 | 2586769a0 |
13 | 13c75938c |
14 | a157d9d6 |
15 | 63704d3c |
hex | 3f756d08 |
1064660232 has 16 divisors (see below), whose sum is σ = 2661650640. Its totient is φ = 354886736.
The previous prime is 1064660227. The next prime is 1064660257. The reversal of 1064660232 is 2320664601.
It is a super-2 number, since 2×10646602322 = 2267002819204587648, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1064660232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22180398 + ... + 22180445.
It is an arithmetic number, because the mean of its divisors is an integer number (166353165).
Almost surely, 21064660232 is an apocalyptic number.
1064660232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1064660232 is an abundant number, since it is smaller than the sum of its proper divisors (1596990408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1064660232 is a wasteful number, since it uses less digits than its factorization.
1064660232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44360852 (or 44360848 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
The square root of 1064660232 is about 32629.1316464291. The cubic root of 1064660232 is about 1021.1048619915.
The spelling of 1064660232 in words is "one billion, sixty-four million, six hundred sixty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •