Base | Representation |
---|---|
bin | 1100011001100111000… |
… | …0011010100100111011 |
3 | 202100212122011212000012 |
4 | 3012121300122210323 |
5 | 11442242422101243 |
6 | 241511020332135 |
7 | 21251104436150 |
oct | 3063160324473 |
9 | 670778155005 |
10 | 213033003323 |
11 | 8238a638528 |
12 | 353543a404b |
13 | 171204a7b6a |
14 | a44cd9c227 |
15 | 581c744d18 |
hex | 3199c1a93b |
213033003323 has 8 divisors (see below), whose sum is σ = 243481421280. Its totient is φ = 182588368320.
The previous prime is 213033003317. The next prime is 213033003367. The reversal of 213033003323 is 323300330312.
213033003323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 213033003323 - 26 = 213033003259 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (213033003223) 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 7 ways as a sum of consecutive naturals, for example, 824018 + ... + 1051223.
It is an arithmetic number, because the mean of its divisors is an integer number (30435177660).
Almost surely, 2213033003323 is an apocalyptic number.
213033003323 is a deficient number, since it is larger than the sum of its proper divisors (30448417957).
213033003323 is a wasteful number, since it uses less digits than its factorization.
213033003323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1891477.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 213033003323 its reverse (323300330312), we get a palindrome (536333333635).
The spelling of 213033003323 in words is "two hundred thirteen billion, thirty-three million, three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •