Base | Representation |
---|---|
bin | 100111011000… |
… | …0010100100000 |
3 | 1102211212211021 |
4 | 1032300110200 |
5 | 20241121102 |
6 | 2014255224 |
7 | 340323643 |
oct | 116602440 |
9 | 42755737 |
10 | 20645152 |
11 | 10721010 |
12 | 6ab7514 |
13 | 437ac88 |
14 | 2a55a5a |
15 | 1c2c137 |
hex | 13b0520 |
20645152 has 48 divisors (see below), whose sum is σ = 44906400. Its totient is φ = 9264640.
The previous prime is 20645147. The next prime is 20645161. The reversal of 20645152 is 25154602.
It is a super-2 number, since 2×206451522 = 852444602206208, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30999 + ... + 31657.
It is an arithmetic number, because the mean of its divisors is an integer number (935550).
Almost surely, 220645152 is an apocalyptic number.
20645152 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20645152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22453200).
20645152 is an abundant number, since it is smaller than the sum of its proper divisors (24261248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20645152 is a wasteful number, since it uses less digits than its factorization.
20645152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 769 (or 761 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 20645152 is about 4543.6936516451. The cubic root of 20645152 is about 274.3296155754.
Adding to 20645152 its reverse (25154602), we get a palindrome (45799754).
The spelling of 20645152 in words is "twenty million, six hundred forty-five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •