Base | Representation |
---|---|
bin | 10010101001010011… |
… | …010000111111111001 |
3 | 1220200020200001011021 |
4 | 102221103100333321 |
5 | 312000142102144 |
6 | 13110331502441 |
7 | 1306056323224 |
oct | 225123207771 |
9 | 56606601137 |
10 | 20020269049 |
11 | 8543a13500 |
12 | 3a688b7a21 |
13 | 1b70953661 |
14 | d7cc805bb |
15 | 7c2921884 |
hex | 4a94d0ff9 |
20020269049 has 27 divisors (see below), whose sum is σ = 23259261711. Its totient is φ = 17216868240.
The previous prime is 20020269043. The next prime is 20020269067. The reversal of 20020269049 is 94096202002.
It is a happy number.
The square root of 20020269049 is 141493.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 19902155625 + 118113424 = 141075^2 + 10868^2 .
It is not a de Polignac number, because 20020269049 - 27 = 20020268921 is a prime.
It is a super-2 number, since 2×200202690492 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20020269043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 29571699 + ... + 29572375.
Almost surely, 220020269049 is an apocalyptic number.
20020269049 is the 141493-rd square number.
20020269049 is the 70747-th centered octagonal number.
It is an amenable number.
20020269049 is a deficient number, since it is larger than the sum of its proper divisors (3238992662).
20020269049 is an frugal number, since it uses more digits than its factorization.
20020269049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1414 (or 707 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 20020269049 in words is "twenty billion, twenty million, two hundred sixty-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •