Base | Representation |
---|---|
bin | 1100011001100110010… |
… | …1011000010001111101 |
3 | 202100212102201212120102 |
4 | 3012121211120101331 |
5 | 11442241202012313 |
6 | 241510434330445 |
7 | 21251041026605 |
oct | 3063145302175 |
9 | 670772655512 |
10 | 213030110333 |
11 | 82388a41a27 |
12 | 35353429a25 |
13 | 1711ca04131 |
14 | a44c847c05 |
15 | 581c372a58 |
hex | 319995847d |
213030110333 has 48 divisors (see below), whose sum is σ = 228901593600. Its totient is φ = 198140532480.
The previous prime is 213030110329. The next prime is 213030110357. The reversal of 213030110333 is 333011030312.
213030110333 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 213030110333 - 22 = 213030110329 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213030110533) 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 47 ways as a sum of consecutive naturals, for example, 1070502968 + ... + 1070503166.
It is an arithmetic number, because the mean of its divisors is an integer number (4768783200).
Almost surely, 2213030110333 is an apocalyptic number.
It is an amenable number.
213030110333 is a deficient number, since it is larger than the sum of its proper divisors (15871483267).
213030110333 is a wasteful number, since it uses less digits than its factorization.
213030110333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618 (or 587 counting only the distinct ones).
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 213030110333 its reverse (333011030312), we get a palindrome (546041140645).
The spelling of 213030110333 in words is "two hundred thirteen billion, thirty million, one hundred ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •