Base | Representation |
---|---|
bin | 111100110100001… |
… | …000011110000100 |
3 | 2122002212120022001 |
4 | 330310020132010 |
5 | 4042144033030 |
6 | 245124315044 |
7 | 34166254030 |
oct | 7464103604 |
9 | 2562776261 |
10 | 1020299140 |
11 | 483a28933 |
12 | 245842a84 |
13 | 1334c6803 |
14 | 997131c0 |
15 | 5e890cca |
hex | 3cd08784 |
1020299140 has 24 divisors (see below), whose sum is σ = 2448718272. Its totient is φ = 349816800.
The previous prime is 1020299123. The next prime is 1020299179. The reversal of 1020299140 is 419920201.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 1020299099 and 1020299108.
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, 3643786 + ... + 3644065.
It is an arithmetic number, because the mean of its divisors is an integer number (102029928).
Almost surely, 21020299140 is an apocalyptic number.
1020299140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020299140 is an abundant number, since it is smaller than the sum of its proper divisors (1428419132).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020299140 is a wasteful number, since it uses less digits than its factorization.
1020299140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7287867 (or 7287865 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 1020299140 is about 31942.1217203867. The cubic root of 1020299140 is about 1006.7211055356.
The spelling of 1020299140 in words is "one billion, twenty million, two hundred ninety-nine thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •