Base | Representation |
---|---|
bin | 1100001111011011011… |
… | …1101000111101010111 |
3 | 202002211011221121201212 |
4 | 3003312313220331113 |
5 | 11421143323223111 |
6 | 240335515212035 |
7 | 21123302204531 |
oct | 3036667507527 |
9 | 662734847655 |
10 | 210300211031 |
11 | 81207a941a9 |
12 | 3491114701b |
13 | 16aa627c4c1 |
14 | a270070851 |
15 | 570c88398b |
hex | 30f6de8f57 |
210300211031 has 8 divisors (see below), whose sum is σ = 212286299904. Its totient is φ = 208314505080.
The previous prime is 210300211027. The next prime is 210300211049. The reversal of 210300211031 is 130112003012.
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 210300211031 - 22 = 210300211027 is a prime.
It is a super-2 number, since 2×2103002110312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210300210997 and 210300211015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210300211531) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1075106 + ... + 1255568.
It is an arithmetic number, because the mean of its divisors is an integer number (26535787488).
Almost surely, 2210300211031 is an apocalyptic number.
210300211031 is a deficient number, since it is larger than the sum of its proper divisors (1986088873).
210300211031 is a wasteful number, since it uses less digits than its factorization.
210300211031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 191461.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 210300211031 its reverse (130112003012), we get a palindrome (340412214043).
The spelling of 210300211031 in words is "two hundred ten billion, three hundred million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •