Base | Representation |
---|---|
bin | 111111101100000… |
… | …000000011111111 |
3 | 2202110120101100102 |
4 | 333230000003333 |
5 | 4142013433244 |
6 | 254005351315 |
7 | 35323044005 |
oct | 7754000377 |
9 | 2673511312 |
10 | 1068499199 |
11 | 4a915a299 |
12 | 259a0853b |
13 | 1404a1861 |
14 | a1c9ca75 |
15 | 63c1254e |
hex | 3fb000ff |
1068499199 has 4 divisors (see below), whose sum is σ = 1068582240. Its totient is φ = 1068416160.
The previous prime is 1068499189. The next prime is 1068499207. The reversal of 1068499199 is 9919948601.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 1068499199 - 228 = 800063743 is a prime.
It is a super-2 number, since 2×10684991992 = 2283381076527283202, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1068499189) 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 3 ways as a sum of consecutive naturals, for example, 17642 + ... + 49479.
It is an arithmetic number, because the mean of its divisors is an integer number (267145560).
Almost surely, 21068499199 is an apocalyptic number.
1068499199 is a deficient number, since it is larger than the sum of its proper divisors (83041).
1068499199 is an equidigital number, since it uses as much as digits as its factorization.
1068499199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83040.
The product of its (nonzero) digits is 1259712, while the sum is 56.
The square root of 1068499199 is about 32687.9060051267. The cubic root of 1068499199 is about 1022.3306946043.
The spelling of 1068499199 in words is "one billion, sixty-eight million, four hundred ninety-nine thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •