Base | Representation |
---|---|
bin | 111111101011010… |
… | …010100111001011 |
3 | 2202110012220222110 |
4 | 333223102213023 |
5 | 4141442004120 |
6 | 254001353403 |
7 | 35321340156 |
oct | 7753224713 |
9 | 2673186873 |
10 | 1068313035 |
11 | 4a9042439 |
12 | 259938863 |
13 | 140437bba |
14 | a1c50c9d |
15 | 63bc72e0 |
hex | 3fad29cb |
1068313035 has 16 divisors (see below), whose sum is σ = 1711982880. Its totient is φ = 568872960.
The previous prime is 1068312989. The next prime is 1068313063. The reversal of 1068313035 is 5303138601.
It is not a de Polignac number, because 1068313035 - 212 = 1068308939 is a prime.
It is a super-2 number, since 2×10683130352 = 2282585481501822450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1068312993 and 1068313011.
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 15 ways as a sum of consecutive naturals, for example, 45940 + ... + 65169.
It is an arithmetic number, because the mean of its divisors is an integer number (106998930).
Almost surely, 21068313035 is an apocalyptic number.
1068313035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1068313035 is a deficient number, since it is larger than the sum of its proper divisors (643669845).
1068313035 is a wasteful number, since it uses less digits than its factorization.
1068313035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111758.
The product of its (nonzero) digits is 6480, while the sum is 30.
The square root of 1068313035 is about 32685.0582835644. The cubic root of 1068313035 is about 1022.2713177931.
The spelling of 1068313035 in words is "one billion, sixty-eight million, three hundred thirteen thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •