Base | Representation |
---|---|
bin | 1001100100000011111111… |
… | …10000100111011110001001 |
3 | 2202110110212222221201010001 |
4 | 10302001333300213132021 |
5 | 10224030030123112413 |
6 | 112421104334123001 |
7 | 4300250343605206 |
oct | 462017760473611 |
9 | 82413788851101 |
10 | 21030303332233 |
11 | 67789a0a76a58 |
12 | 2437992050461 |
13 | b971c273b0a0 |
14 | 529c2d10ccad |
15 | 2670a6b924dd |
hex | 13207fc27789 |
21030303332233 has 8 divisors (see below), whose sum is σ = 22649206305600. Its totient is φ = 19411569977808.
The previous prime is 21030303332219. The next prime is 21030303332249. The reversal of 21030303332233 is 33223330303012.
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 21030303332233 - 225 = 21030269777801 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (21030303332333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42147163 + ... + 42643216.
It is an arithmetic number, because the mean of its divisors is an integer number (2831150788200).
Almost surely, 221030303332233 is an apocalyptic number.
It is an amenable number.
21030303332233 is a deficient number, since it is larger than the sum of its proper divisors (1618902973367).
21030303332233 is a wasteful number, since it uses less digits than its factorization.
21030303332233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84809471.
The product of its (nonzero) digits is 17496, while the sum is 28.
Adding to 21030303332233 its reverse (33223330303012), we get a palindrome (54253633635245).
The spelling of 21030303332233 in words is "twenty-one trillion, thirty billion, three hundred three million, three hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •