Base | Representation |
---|---|
bin | 10011100101101010… |
… | …111010111110000001 |
3 | 2000021211111100110110 |
4 | 103211222322332001 |
5 | 321033433300413 |
6 | 13355032221533 |
7 | 1343135266452 |
oct | 234552727601 |
9 | 60254440413 |
10 | 21033103233 |
11 | 8a1370284a |
12 | 40abb3a8a9 |
13 | 1ca273541c |
14 | 10375ad129 |
15 | 8317da8c3 |
hex | 4e5abaf81 |
21033103233 has 4 divisors (see below), whose sum is σ = 28044137648. Its totient is φ = 14022068820.
The previous prime is 21033103211. The next prime is 21033103243. The reversal of 21033103233 is 33230133012.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 21033103233 - 212 = 21033099137 is a prime.
It is a super-2 number, since 2×210331032332 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21033103243) 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, 3505517203 + ... + 3505517208.
It is an arithmetic number, because the mean of its divisors is an integer number (7011034412).
Almost surely, 221033103233 is an apocalyptic number.
It is an amenable number.
21033103233 is a deficient number, since it is larger than the sum of its proper divisors (7011034415).
21033103233 is an equidigital number, since it uses as much as digits as its factorization.
21033103233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7011034414.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 21033103233 its reverse (33230133012), we get a palindrome (54263236245).
The spelling of 21033103233 in words is "twenty-one billion, thirty-three million, one hundred three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •