Base | Representation |
---|---|
bin | 10011101111101001… |
… | …100010100100110101 |
3 | 2000201111111122221112 |
4 | 103233221202210311 |
5 | 321404312411313 |
6 | 13423412324405 |
7 | 1350240250526 |
oct | 235751424465 |
9 | 60644448845 |
10 | 21200513333 |
11 | 8a9a1564aa |
12 | 4138013705 |
13 | 1ccb31b95c |
14 | 105190a84d |
15 | 8413588a8 |
hex | 4efa62935 |
21200513333 has 4 divisors (see below), whose sum is σ = 21202547340. Its totient is φ = 21198479328.
The previous prime is 21200513317. The next prime is 21200513363. The reversal of 21200513333 is 33331500212.
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 7757734084 + 13442779249 = 88078^2 + 115943^2 .
It is a cyclic number.
It is not a de Polignac number, because 21200513333 - 24 = 21200513317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21200513299 and 21200513308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21200513303) 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, 1001288 + ... + 1022241.
It is an arithmetic number, because the mean of its divisors is an integer number (5300636835).
Almost surely, 221200513333 is an apocalyptic number.
It is an amenable number.
21200513333 is a deficient number, since it is larger than the sum of its proper divisors (2034007).
21200513333 is a wasteful number, since it uses less digits than its factorization.
21200513333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2034006.
The product of its (nonzero) digits is 1620, while the sum is 23.
The spelling of 21200513333 in words is "twenty-one billion, two hundred million, five hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •