Base | Representation |
---|---|
bin | 1100001111000011111… |
… | …0010111111101100011 |
3 | 202002120021212002022101 |
4 | 3003300332113331203 |
5 | 11420443014004443 |
6 | 240322023351231 |
7 | 21120661452454 |
oct | 3036076277543 |
9 | 662507762271 |
10 | 210201313123 |
11 | 8116718579a |
12 | 348a3bb2517 |
13 | 16a8b933529 |
14 | a260c8912b |
15 | 5703d4a84d |
hex | 30f0f97f63 |
210201313123 has 8 divisors (see below), whose sum is σ = 212790065040. Its totient is φ = 207617604480.
The previous prime is 210201313097. The next prime is 210201313163. The reversal of 210201313123 is 321313102012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210201313123 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 210201313123.
It is not an unprimeable number, because it can be changed into a prime (210201313163) 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, 1176913 + ... + 1343698.
It is an arithmetic number, because the mean of its divisors is an integer number (26598758130).
Almost surely, 2210201313123 is an apocalyptic number.
210201313123 is a deficient number, since it is larger than the sum of its proper divisors (2588751917).
210201313123 is an equidigital number, since it uses as much as digits as its factorization.
210201313123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2521637.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 210201313123 its reverse (321313102012), we get a palindrome (531514415135).
The spelling of 210201313123 in words is "two hundred ten billion, two hundred one million, three hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •