Base | Representation |
---|---|
bin | 1001100100001001100100… |
… | …11000110001011001111101 |
3 | 2202110202121212002112010120 |
4 | 10302010302120301121331 |
5 | 10224102144323000013 |
6 | 112422321551325153 |
7 | 4300414533566151 |
oct | 462046230613175 |
9 | 82422555075116 |
10 | 21033300203133 |
11 | 677a19969a469 |
12 | 24384898207b9 |
13 | b9757c59828a |
14 | 52a03513d061 |
15 | 2671ced19123 |
hex | 13213263167d |
21033300203133 has 8 divisors (see below), whose sum is σ = 28249103923008. Its totient is φ = 13919848309344.
The previous prime is 21033300203087. The next prime is 21033300203177. The reversal of 21033300203133 is 33130200333012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21033300203133 - 241 = 18834276947581 is a prime.
It is a super-2 number, since 2×210333002031332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21033300203033) 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, 25587956041 + ... + 25587956862.
It is an arithmetic number, because the mean of its divisors is an integer number (3531137990376).
Almost surely, 221033300203133 is an apocalyptic number.
It is an amenable number.
21033300203133 is a deficient number, since it is larger than the sum of its proper divisors (7215803719875).
21033300203133 is a wasteful number, since it uses less digits than its factorization.
21033300203133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51175913043.
The product of its (nonzero) digits is 2916, while the sum is 24.
Adding to 21033300203133 its reverse (33130200333012), we get a palindrome (54163500536145).
The spelling of 21033300203133 in words is "twenty-one trillion, thirty-three billion, three hundred million, two hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •