Base | Representation |
---|---|
bin | 111111101010010… |
… | …010011011100100 |
3 | 2202102201120100220 |
4 | 333222102123210 |
5 | 4141410101043 |
6 | 253552004340 |
7 | 35316163554 |
oct | 7752223344 |
9 | 2672646326 |
10 | 1068050148 |
11 | 4a8982980 |
12 | 2598306b0 |
13 | 140375349 |
14 | a1bc3164 |
15 | 63b74483 |
hex | 3fa926e4 |
1068050148 has 24 divisors (see below), whose sum is σ = 2718673440. Its totient is φ = 323651520.
The previous prime is 1068050147. The next prime is 1068050167. The reversal of 1068050148 is 8410508601.
It is a super-2 number, since 2×10680501482 = 2281462237285643808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (1068050141) 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 7 ways as a sum of consecutive naturals, for example, 4045513 + ... + 4045776.
It is an arithmetic number, because the mean of its divisors is an integer number (113278060).
Almost surely, 21068050148 is an apocalyptic number.
It is an amenable number.
1068050148 is an abundant number, since it is smaller than the sum of its proper divisors (1650623292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1068050148 is a wasteful number, since it uses less digits than its factorization.
1068050148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8091307 (or 8091305 counting only the distinct ones).
The product of its (nonzero) digits is 7680, while the sum is 33.
The square root of 1068050148 is about 32681.0365196699. The cubic root of 1068050148 is about 1022.1874585129.
Adding to 1068050148 its reverse (8410508601), we get a palindrome (9478558749).
The spelling of 1068050148 in words is "one billion, sixty-eight million, fifty thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •