Base | Representation |
---|---|
bin | 10011110011110110… |
… | …011100101101010000 |
3 | 2000220102011001202020 |
4 | 103303312130231100 |
5 | 322030334143112 |
6 | 13434411251440 |
7 | 1352054365563 |
oct | 236366345520 |
9 | 60812131666 |
10 | 21271006032 |
11 | 9025a23731 |
12 | 4157749b80 |
13 | 200cb00803 |
14 | 105b01a4da |
15 | 84763048c |
hex | 4f3d9cb50 |
21271006032 has 20 divisors (see below), whose sum is σ = 54950099040. Its totient is φ = 7090335328.
The previous prime is 21271005997. The next prime is 21271006051. The reversal of 21271006032 is 23060017212.
It is a super-2 number, since 2×212710060322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 21271005993 and 21271006011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 221572932 + ... + 221573027.
It is an arithmetic number, because the mean of its divisors is an integer number (2747504952).
Almost surely, 221271006032 is an apocalyptic number.
It is an amenable number.
21271006032 is an abundant number, since it is smaller than the sum of its proper divisors (33679093008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21271006032 is a wasteful number, since it uses less digits than its factorization.
21271006032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 443145970 (or 443145964 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 24.
The spelling of 21271006032 in words is "twenty-one billion, two hundred seventy-one million, six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •