Base | Representation |
---|---|
bin | 101001111000… |
… | …1100111000000 |
3 | 1112022202001000 |
4 | 1103301213000 |
5 | 21110224102 |
6 | 2102412000 |
7 | 354444453 |
oct | 123614700 |
9 | 45282030 |
10 | 21961152 |
11 | 1143a814 |
12 | 7431000 |
13 | 471bc85 |
14 | 2cb949a |
15 | 1ddc01c |
hex | 14f19c0 |
21961152 has 112 divisors (see below), whose sum is σ = 65836800. Its totient is φ = 7176960.
The previous prime is 21961151. The next prime is 21961171. The reversal of 21961152 is 25116912.
21961152 is nontrivially palindromic in base 7.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 12.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21961151) 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 15 ways as a sum of consecutive naturals, for example, 122599 + ... + 122777.
Almost surely, 221961152 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 21961152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (32918400).
21961152 is an abundant number, since it is smaller than the sum of its proper divisors (43875648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21961152 is a wasteful number, since it uses less digits than its factorization.
21961152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271 (or 255 counting only the distinct ones).
The product of its digits is 1080, while the sum is 27.
The square root of 21961152 is about 4686.2727193368. The cubic root of 21961152 is about 280.0389061583.
The spelling of 21961152 in words is "twenty-one million, nine hundred sixty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •