Base | Representation |
---|---|
bin | 111111001111011… |
… | …001010010001010 |
3 | 2201221110101211112 |
4 | 333033121102022 |
5 | 4133104002310 |
6 | 253140530322 |
7 | 35202232265 |
oct | 7717312212 |
9 | 2657411745 |
10 | 1061000330 |
11 | 4a49a8285 |
12 | 2573b09a2 |
13 | 13ba77560 |
14 | a0ca9cdc |
15 | 63230705 |
hex | 3f3d948a |
1061000330 has 32 divisors (see below), whose sum is σ = 2058814800. Its totient is φ = 391352832.
The previous prime is 1061000321. The next prime is 1061000333. The reversal of 1061000330 is 330001601.
It is a Cunningham number, because it is equal to 325732+1.
It can be written as a sum of positive squares in 8 ways, for example, as 381928849 + 679071481 = 19543^2 + 26059^2 .
It is a super-2 number, since 2×10610003302 = 2251443400520217800, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1061000333) 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 15 ways as a sum of consecutive naturals, for example, 143156 + ... + 150384.
Almost surely, 21061000330 is an apocalyptic number.
1061000330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1061000330 is a deficient number, since it is larger than the sum of its proper divisors (997814470).
1061000330 is a wasteful number, since it uses less digits than its factorization.
1061000330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8378.
The product of its (nonzero) digits is 54, while the sum is 14.
The square root of 1061000330 is about 32573.0000153501. Note that the first 4 decimals coincide. The cubic root of 1061000330 is about 1019.9334603525.
Adding to 1061000330 its reverse (330001601), we get a palindrome (1391001931).
The spelling of 1061000330 in words is "one billion, sixty-one million, three hundred thirty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •