Base | Representation |
---|---|
bin | 10011000100010101… |
… | …101010110110110001 |
3 | 1221211212020002000000 |
4 | 103010111222312301 |
5 | 313412303242311 |
6 | 13223334220213 |
7 | 1323235100100 |
oct | 230425526661 |
9 | 57755202000 |
10 | 20473884081 |
11 | 8756a79162 |
12 | 3b747b4669 |
13 | 1c13917911 |
14 | dc3200037 |
15 | 7ec676056 |
hex | 4c456adb1 |
20473884081 has 42 divisors (see below), whose sum is σ = 35708565762. Its totient is φ = 11699341920.
The previous prime is 20473884073. The next prime is 20473884083. The reversal of 20473884081 is 18048837402.
20473884081 is a `hidden beast` number, since 20 + 473 + 8 + 84 + 0 + 81 = 666.
It can be written as a sum of positive squares in only one way, i.e., 20361863025 + 112021056 = 142695^2 + 10584^2 .
It is not a de Polignac number, because 20473884081 - 23 = 20473884073 is a prime.
It is a super-2 number, since 2×204738840812 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20473884083) 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 41 ways as a sum of consecutive naturals, for example, 250860 + ... + 322301.
Almost surely, 220473884081 is an apocalyptic number.
20473884081 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20473884081 is a deficient number, since it is larger than the sum of its proper divisors (15234681681).
20473884081 is an frugal number, since it uses more digits than its factorization.
20473884081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 573193 (or 573171 counting only the distinct ones).
The product of its (nonzero) digits is 344064, while the sum is 45.
The spelling of 20473884081 in words is "twenty billion, four hundred seventy-three million, eight hundred eighty-four thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •