Base | Representation |
---|---|
bin | 111101001010001… |
… | …001011010000010 |
3 | 2122111201202122000 |
4 | 331022021122002 |
5 | 4100133221041 |
6 | 245452124430 |
7 | 34266311103 |
oct | 7512113202 |
9 | 2574652560 |
10 | 1026070146 |
11 | 48720a762 |
12 | 247766716 |
13 | 1347674ca |
14 | 9a3b63aa |
15 | 60130bb6 |
hex | 3d289682 |
1026070146 has 16 divisors (see below), whose sum is σ = 2280156000. Its totient is φ = 342023364.
The previous prime is 1026070127. The next prime is 1026070159. The reversal of 1026070146 is 6410706201.
1026070146 is a `hidden beast` number, since 10 + 2 + 607 + 0 + 1 + 46 = 666.
It is a super-2 number, since 2×10260701462 = 2105639889024922632, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9500596 + ... + 9500703.
It is an arithmetic number, because the mean of its divisors is an integer number (142509750).
Almost surely, 21026070146 is an apocalyptic number.
1026070146 is an abundant number, since it is smaller than the sum of its proper divisors (1254085854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1026070146 is a wasteful number, since it uses less digits than its factorization.
1026070146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19001310 (or 19001304 counting only the distinct ones).
The product of its (nonzero) digits is 2016, while the sum is 27.
The square root of 1026070146 is about 32032.3296998517. The cubic root of 1026070146 is about 1008.6156068109.
Adding to 1026070146 its reverse (6410706201), we get a palindrome (7436776347).
The spelling of 1026070146 in words is "one billion, twenty-six million, seventy thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •