Base | Representation |
---|---|
bin | 10011101010011010… |
… | …100100000011001100 |
3 | 2000111101021100020210 |
4 | 103222122210003030 |
5 | 321214322414012 |
6 | 13410554242420 |
7 | 1345122666345 |
oct | 235232440314 |
9 | 60441240223 |
10 | 21112701132 |
11 | 8a54629936 |
12 | 4112726410 |
13 | 1cb6084783 |
14 | 1043dad0cc |
15 | 8387b023c |
hex | 4ea6a40cc |
21112701132 has 96 divisors (see below), whose sum is σ = 53033121792. Its totient is φ = 6513371136.
The previous prime is 21112701131. The next prime is 21112701139. The reversal of 21112701132 is 23110721112.
It is a super-2 number, since 2×211127011322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21112701099 and 21112701108.
It is not an unprimeable number, because it can be changed into a prime (21112701131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5463433 + ... + 5467295.
It is an arithmetic number, because the mean of its divisors is an integer number (552428352).
Almost surely, 221112701132 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 21112701132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26516560896).
21112701132 is an abundant number, since it is smaller than the sum of its proper divisors (31920420660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21112701132 is a wasteful number, since it uses less digits than its factorization.
21112701132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4327 (or 4325 counting only the distinct ones).
The product of its (nonzero) digits is 168, while the sum is 21.
The spelling of 21112701132 in words is "twenty-one billion, one hundred twelve million, seven hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •