Base | Representation |
---|---|
bin | 1100011001100110010… |
… | …1101110101110111101 |
3 | 202100212102220112201122 |
4 | 3012121211232232331 |
5 | 11442241212433201 |
6 | 241510440320325 |
7 | 21251041562000 |
oct | 3063145565675 |
9 | 670772815648 |
10 | 213030202301 |
11 | 82388aa5034 |
12 | 353534730a5 |
13 | 1711ca36c57 |
14 | a44c86d537 |
15 | 581c38ee1b |
hex | 319996ebbd |
213030202301 has 32 divisors (see below), whose sum is σ = 250539878400. Its totient is φ = 181054476288.
The previous prime is 213030202289. The next prime is 213030202303. The reversal of 213030202301 is 103202030312.
It is a de Polignac number, because none of the positive numbers 2k-213030202301 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 213030202301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (213030202303) 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 31 ways as a sum of consecutive naturals, for example, 19652255 + ... + 19663091.
It is an arithmetic number, because the mean of its divisors is an integer number (7829371200).
Almost surely, 2213030202301 is an apocalyptic number.
It is an amenable number.
213030202301 is a deficient number, since it is larger than the sum of its proper divisors (37509676099).
213030202301 is a wasteful number, since it uses less digits than its factorization.
213030202301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11338 (or 11324 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 213030202301 its reverse (103202030312), we get a palindrome (316232232613).
The spelling of 213030202301 in words is "two hundred thirteen billion, thirty million, two hundred two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •