Base | Representation |
---|---|
bin | 111111101010111… |
… | …000000000111011 |
3 | 2202110000101112111 |
4 | 333222320000323 |
5 | 4141430012331 |
6 | 253555153151 |
7 | 35320404433 |
oct | 7752700073 |
9 | 2673011474 |
10 | 1068204091 |
11 | 4a8a785a9 |
12 | 2598a57b7 |
13 | 1403ca436 |
14 | a1c232c3 |
15 | 63ba4db1 |
hex | 3fab803b |
1068204091 has 4 divisors (see below), whose sum is σ = 1068652872. Its totient is φ = 1067755312.
The previous prime is 1068204089. The next prime is 1068204101. The reversal of 1068204091 is 1904028601.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1904028601 = 401 ⋅4748201.
It is a cyclic number.
It is not a de Polignac number, because 1068204091 - 21 = 1068204089 is a prime.
It is a super-2 number, since 2×10682040912 = 2282119960058272562, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1068204191) 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, 220801 + ... + 225586.
It is an arithmetic number, because the mean of its divisors is an integer number (267163218).
Almost surely, 21068204091 is an apocalyptic number.
1068204091 is a deficient number, since it is larger than the sum of its proper divisors (448781).
1068204091 is an equidigital number, since it uses as much as digits as its factorization.
1068204091 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 448780.
The product of its (nonzero) digits is 3456, while the sum is 31.
The square root of 1068204091 is about 32683.3916691643. The cubic root of 1068204091 is about 1022.2365670198.
The spelling of 1068204091 in words is "one billion, sixty-eight million, two hundred four thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •