Base | Representation |
---|---|
bin | 100110011011… |
… | …0011100100000 |
3 | 1101220112001101 |
4 | 1030312130200 |
5 | 20124132302 |
6 | 1555444144 |
7 | 333144361 |
oct | 114663440 |
9 | 41815041 |
10 | 20145952 |
11 | 1040aa52 |
12 | 68b6654 |
13 | 42349a8 |
14 | 2965b68 |
15 | 1b7e287 |
hex | 1336720 |
20145952 has 48 divisors (see below), whose sum is σ = 43477560. Its totient is φ = 9146368.
The previous prime is 20145949. The next prime is 20145959. The reversal of 20145952 is 25954102.
It can be written as a sum of positive squares in 4 ways, for example, as 19678096 + 467856 = 4436^2 + 684^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 20145952.
It is not an unprimeable number, because it can be changed into a prime (20145959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15138 + ... + 16414.
Almost surely, 220145952 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 20145952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21738780).
20145952 is an abundant number, since it is smaller than the sum of its proper divisors (23331608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20145952 is a wasteful number, since it uses less digits than its factorization.
20145952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1333 (or 1325 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 28.
The square root of 20145952 is about 4488.4242223747. The cubic root of 20145952 is about 272.1004530929.
The spelling of 20145952 in words is "twenty million, one hundred forty-five thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •