Base | Representation |
---|---|
bin | 100110010101… |
… | …0101000000100 |
3 | 1101211001122100 |
4 | 1030222220010 |
5 | 20121110130 |
6 | 1554432100 |
7 | 332553261 |
oct | 114525004 |
9 | 41731570 |
10 | 20097540 |
11 | 10387641 |
12 | 6892630 |
13 | 4218948 |
14 | 2952268 |
15 | 1b6ec60 |
hex | 132aa04 |
20097540 has 36 divisors (see below), whose sum is σ = 60963084. Its totient is φ = 5359296.
The previous prime is 20097509. The next prime is 20097563. The reversal of 20097540 is 4579002.
It can be written as a sum of positive squares in 2 ways, for example, as 7650756 + 12446784 = 2766^2 + 3528^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×200975402 = 807822228103200, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 55647 + ... + 56006.
It is an arithmetic number, because the mean of its divisors is an integer number (1693419).
Almost surely, 220097540 is an apocalyptic number.
20097540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20097540 is an abundant number, since it is smaller than the sum of its proper divisors (40865544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20097540 is a wasteful number, since it uses less digits than its factorization.
20097540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 111668 (or 111663 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 20097540 is about 4483.0279945590. The cubic root of 20097540 is about 271.8823200566.
The spelling of 20097540 in words is "twenty million, ninety-seven thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •