Base | Representation |
---|---|
bin | 10010101000001000… |
… | …100110100001110100 |
3 | 1220121212211122120200 |
4 | 102220020212201310 |
5 | 311430134241221 |
6 | 13104352200500 |
7 | 1305431054220 |
oct | 225010464164 |
9 | 56555748520 |
10 | 20000696436 |
11 | 8533965296 |
12 | 3a62239130 |
13 | 1b6988c926 |
14 | d7a427780 |
15 | 7c0d57426 |
hex | 4a8226874 |
20000696436 has 144 divisors (see below), whose sum is σ = 59803161600. Its totient is φ = 5515361280.
The previous prime is 20000696413. The next prime is 20000696461. The reversal of 20000696436 is 63469600002.
20000696436 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 0 + 6 + 9 + 643 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 20000696436.
It is a congruent number.
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 47 ways as a sum of consecutive naturals, for example, 3098140 + ... + 3104588.
Almost surely, 220000696436 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20000696436, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29901580800).
20000696436 is an abundant number, since it is smaller than the sum of its proper divisors (39802465164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000696436 is a wasteful number, since it uses less digits than its factorization.
20000696436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6894 (or 6889 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 36.
The spelling of 20000696436 in words is "twenty billion, six hundred ninety-six thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •