Base | Representation |
---|---|
bin | 1100001111100011001… |
… | …0000101111100001011 |
3 | 202002220102100111000222 |
4 | 3003320302011330023 |
5 | 11421230032430212 |
6 | 240343023220255 |
7 | 21124142101406 |
oct | 3037062057413 |
9 | 662812314028 |
10 | 210332311307 |
11 | 81224119658 |
12 | 3491ba4768b |
13 | 16aacb0b451 |
14 | a274428d3d |
15 | 57105c4c72 |
hex | 30f8c85f0b |
210332311307 has 8 divisors (see below), whose sum is σ = 211133757600. Its totient is φ = 209531010304.
The previous prime is 210332311253. The next prime is 210332311349. The reversal of 210332311307 is 703113233012.
210332311307 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 210332311307 - 28 = 210332311051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210332301307) 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, 3525794 + ... + 3584952.
It is an arithmetic number, because the mean of its divisors is an integer number (26391719700).
Almost surely, 2210332311307 is an apocalyptic number.
210332311307 is a deficient number, since it is larger than the sum of its proper divisors (801446293).
210332311307 is a wasteful number, since it uses less digits than its factorization.
210332311307 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72645.
The product of its (nonzero) digits is 2268, while the sum is 26.
Adding to 210332311307 its reverse (703113233012), we get a palindrome (913445544319).
The spelling of 210332311307 in words is "two hundred ten billion, three hundred thirty-two million, three hundred eleven thousand, three hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •