Base | Representation |
---|---|
bin | 10011110000110100… |
… | …101001001101110101 |
3 | 2000202212112220210201 |
4 | 103300310221031311 |
5 | 321424332420313 |
6 | 13425354320501 |
7 | 1350566510122 |
oct | 236064511565 |
9 | 60685486721 |
10 | 21220201333 |
11 | 8aaa283381 |
12 | 4142729131 |
13 | 2002423066 |
14 | 1054393749 |
15 | 842e470dd |
hex | 4f0d29375 |
21220201333 has 8 divisors (see below), whose sum is σ = 21580444160. Its totient is φ = 20860357680.
The previous prime is 21220201253. The next prime is 21220201351. The reversal of 21220201333 is 33310202212.
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 21220201333 - 221 = 21218104181 is a prime.
It is a super-2 number, since 2×212202013332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21220201333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21220201393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8416 + ... + 206182.
It is an arithmetic number, because the mean of its divisors is an integer number (2697555520).
Almost surely, 221220201333 is an apocalyptic number.
It is an amenable number.
21220201333 is a deficient number, since it is larger than the sum of its proper divisors (360242827).
21220201333 is a wasteful number, since it uses less digits than its factorization.
21220201333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 199587.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 21220201333 its reverse (33310202212), we get a palindrome (54530403545).
The spelling of 21220201333 in words is "twenty-one billion, two hundred twenty million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •