Base | Representation |
---|---|
bin | 111111101011101… |
… | …010000100000100 |
3 | 2202110101210202010 |
4 | 333223222010010 |
5 | 4142003042332 |
6 | 254003414220 |
7 | 35322220212 |
oct | 7753520404 |
9 | 2673353663 |
10 | 1068409092 |
11 | 4a90a8623 |
12 | 259984370 |
13 | 14046c83a |
14 | a1c77cb2 |
15 | 63be59cc |
hex | 3faea104 |
1068409092 has 24 divisors (see below), whose sum is σ = 2493590400. Its totient is φ = 356045536.
The previous prime is 1068409063. The next prime is 1068409103. The reversal of 1068409092 is 2909048601.
1068409092 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10684090922 = 2282995975736528928, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1068409092.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51634 + ... + 69302.
It is an arithmetic number, because the mean of its divisors is an integer number (103899600).
Almost surely, 21068409092 is an apocalyptic number.
1068409092 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1068409092 is an abundant number, since it is smaller than the sum of its proper divisors (1425181308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1068409092 is a wasteful number, since it uses less digits than its factorization.
1068409092 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22715 (or 22713 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 39.
The square root of 1068409092 is about 32686.5276834356. The cubic root of 1068409092 is about 1022.3019559331.
The spelling of 1068409092 in words is "one billion, sixty-eight million, four hundred nine thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.255 sec. • engine limits •