Base | Representation |
---|---|
bin | 10011110110110010… |
… | …100000001011100011 |
3 | 2001000211220121221010 |
4 | 103312302200023203 |
5 | 322130444201311 |
6 | 13443332032003 |
7 | 1353223405515 |
oct | 236662401343 |
9 | 61024817833 |
10 | 21320303331 |
11 | 90508344a8 |
12 | 4170162603 |
13 | 201a0a1102 |
14 | 10637adbb5 |
15 | 84bb1bda6 |
hex | 4f6ca02e3 |
21320303331 has 8 divisors (see below), whose sum is σ = 28430700624. Its totient is φ = 14211720800.
The previous prime is 21320303327. The next prime is 21320303369. The reversal of 21320303331 is 13330302312.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21320303331 - 22 = 21320303327 is a prime.
It is a super-2 number, since 2×213203033312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21320303298 and 21320303307.
It is not an unprimeable number, because it can be changed into a prime (21320303321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 426036 + ... + 473441.
It is an arithmetic number, because the mean of its divisors is an integer number (3553837578).
Almost surely, 221320303331 is an apocalyptic number.
21320303331 is a deficient number, since it is larger than the sum of its proper divisors (7110397293).
21320303331 is an equidigital number, since it uses as much as digits as its factorization.
21320303331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 907381.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 21320303331 its reverse (13330302312), we get a palindrome (34650605643).
The spelling of 21320303331 in words is "twenty-one billion, three hundred twenty million, three hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •