Base | Representation |
---|---|
bin | 10011101010010100… |
… | …000101100001100000 |
3 | 2000111021002002011121 |
4 | 103222110011201200 |
5 | 321213404100412 |
6 | 13410454022024 |
7 | 1345102365244 |
oct | 235224054140 |
9 | 60437062147 |
10 | 21111003232 |
11 | 8a5367a210 |
12 | 4112047914 |
13 | 1cb590b9b7 |
14 | 1043a8a424 |
15 | 838577107 |
hex | 4ea505860 |
21111003232 has 24 divisors (see below), whose sum is σ = 45340678152. Its totient is φ = 9595910400.
The previous prime is 21111003211. The next prime is 21111003239. The reversal of 21111003232 is 23230011112.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21111003239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29986869 + ... + 29987572.
It is an arithmetic number, because the mean of its divisors is an integer number (1889194923).
Almost surely, 221111003232 is an apocalyptic number.
21111003232 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21111003232 is an abundant number, since it is smaller than the sum of its proper divisors (24229674920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21111003232 is a wasteful number, since it uses less digits than its factorization.
21111003232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59974462 (or 59974454 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 21111003232 its reverse (23230011112), we get a palindrome (44341014344).
The spelling of 21111003232 in words is "twenty-one billion, one hundred eleven million, three thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •