Base | Representation |
---|---|
bin | 1100001111011011111… |
… | …0111101100010000111 |
3 | 202002211022120010111022 |
4 | 3003312332331202013 |
5 | 11421144321132221 |
6 | 240340024301355 |
7 | 21123324420230 |
oct | 3036676754207 |
9 | 662738503438 |
10 | 210302130311 |
11 | 81209085189 |
12 | 3491191185b |
13 | 16aa67a1c80 |
14 | a270410087 |
15 | 570cb124ab |
hex | 30f6fbd887 |
210302130311 has 8 divisors (see below), whose sum is σ = 258833391264. Its totient is φ = 166392894240.
The previous prime is 210302130307. The next prime is 210302130329. The reversal of 210302130311 is 113031203012.
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 210302130311 - 22 = 210302130307 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 210302130311.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210302130391) 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, 1155506120 + ... + 1155506301.
It is an arithmetic number, because the mean of its divisors is an integer number (32354173908).
Almost surely, 2210302130311 is an apocalyptic number.
210302130311 is a deficient number, since it is larger than the sum of its proper divisors (48531260953).
210302130311 is a wasteful number, since it uses less digits than its factorization.
210302130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2311012441.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 210302130311 its reverse (113031203012), we get a palindrome (323333333323).
The spelling of 210302130311 in words is "two hundred ten billion, three hundred two million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •