Base | Representation |
---|---|
bin | 111111011110001… |
… | …000101001011100 |
3 | 2202012201201021022 |
4 | 333132020221130 |
5 | 4140101124343 |
6 | 253355423312 |
7 | 35250124532 |
oct | 7736105134 |
9 | 2665651238 |
10 | 1064864348 |
11 | 4a70a7389 |
12 | 258754b38 |
13 | 13c7cb262 |
14 | a15d4152 |
15 | 63745568 |
hex | 3f788a5c |
1064864348 has 24 divisors (see below), whose sum is σ = 1962826320. Its totient is φ = 504092160.
The previous prime is 1064864347. The next prime is 1064864371. The reversal of 1064864348 is 8434684601.
It is a super-2 number, since 2×10648643482 = 2267872159282930208, which contains 22 as substring.
It is a Smith number, since the sum of its digits (44) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 1064864299 and 1064864308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1064864347) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 154790 + ... + 161522.
It is an arithmetic number, because the mean of its divisors is an integer number (81784430).
Almost surely, 21064864348 is an apocalyptic number.
It is an amenable number.
1064864348 is a deficient number, since it is larger than the sum of its proper divisors (897961972).
1064864348 is a wasteful number, since it uses less digits than its factorization.
1064864348 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8837 (or 8835 counting only the distinct ones).
The product of its (nonzero) digits is 442368, while the sum is 44.
The square root of 1064864348 is about 32632.2593149785. The cubic root of 1064864348 is about 1021.1701130189.
The spelling of 1064864348 in words is "one billion, sixty-four million, eight hundred sixty-four thousand, three hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •