Base | Representation |
---|---|
bin | 111101011000011… |
… | …000100001100001 |
3 | 2122202202100212211 |
4 | 331120120201201 |
5 | 4102112131311 |
6 | 250104122121 |
7 | 34343113300 |
oct | 7530304141 |
9 | 2582670784 |
10 | 1029802081 |
11 | 489329600 |
12 | 248a66341 |
13 | 135473059 |
14 | 9aaa8437 |
15 | 6061b821 |
hex | 3d618861 |
1029802081 has 54 divisors (see below), whose sum is σ = 1401074934. Its totient is φ = 753984000.
The previous prime is 1029802073. The next prime is 1029802087. The reversal of 1029802081 is 1802089201.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 607129600 + 422672481 = 24640^2 + 20559^2 .
It is not a de Polignac number, because 1029802081 - 23 = 1029802073 is a prime.
It is a super-2 number, since 2×10298020812 = 2120984652063861122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1029802087) by changing a digit.
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 53 ways as a sum of consecutive naturals, for example, 1713181 + ... + 1713781.
Almost surely, 21029802081 is an apocalyptic number.
1029802081 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1029802081 is a deficient number, since it is larger than the sum of its proper divisors (371272853).
1029802081 is a wasteful number, since it uses less digits than its factorization.
1029802081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671 (or 636 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 31.
The square root of 1029802081 is about 32090.5294596396. The cubic root of 1029802081 is about 1009.8369442359.
The spelling of 1029802081 in words is "one billion, twenty-nine million, eight hundred two thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •