Base | Representation |
---|---|
bin | 10011110110111110… |
… | …000011001000110101 |
3 | 2001001001121101212201 |
4 | 103312332003020311 |
5 | 322132233030401 |
6 | 13443520544501 |
7 | 1353261213103 |
oct | 236676031065 |
9 | 61031541781 |
10 | 21323330101 |
11 | 9052511567 |
12 | 4171182131 |
13 | 201a8c09b8 |
14 | 1063d5ac73 |
15 | 84c018b01 |
hex | 4f6f83235 |
21323330101 has 4 divisors (see below), whose sum is σ = 21329677804. Its totient is φ = 21316982400.
The previous prime is 21323330081. The next prime is 21323330111. The reversal of 21323330101 is 10103332312.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 6122906001 + 15200424100 = 78249^2 + 123290^2 .
It is a cyclic number.
It is not a de Polignac number, because 21323330101 - 25 = 21323330069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21323330111) by changing a digit.
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, 3168810 + ... + 3175531.
It is an arithmetic number, because the mean of its divisors is an integer number (5332419451).
Almost surely, 221323330101 is an apocalyptic number.
It is an amenable number.
21323330101 is a deficient number, since it is larger than the sum of its proper divisors (6347703).
21323330101 is an equidigital number, since it uses as much as digits as its factorization.
21323330101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6347702.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 21323330101 its reverse (10103332312), we get a palindrome (31426662413).
The spelling of 21323330101 in words is "twenty-one billion, three hundred twenty-three million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •