Base | Representation |
---|---|
bin | 1100001111110101111… |
… | …1000101010110010111 |
3 | 202010002220211011111111 |
4 | 3003331133011112113 |
5 | 11421410232323411 |
6 | 240354522315451 |
7 | 21126120545161 |
oct | 3037537052627 |
9 | 663086734444 |
10 | 210411214231 |
11 | 81264710589 |
12 | 34942358b87 |
13 | 16ac327637a |
14 | a280ac7931 |
15 | 57174ad721 |
hex | 30fd7c5597 |
210411214231 has 8 divisors (see below), whose sum is σ = 210850496640. Its totient is φ = 209972207928.
The previous prime is 210411214229. The next prime is 210411214261. The reversal of 210411214231 is 132412114012.
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 210411214231 - 21 = 210411214229 is a prime.
It is a super-2 number, since 2×2104112142312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210411214261) 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, 1493430 + ... + 1628236.
It is an arithmetic number, because the mean of its divisors is an integer number (26356312080).
Almost surely, 2210411214231 is an apocalyptic number.
210411214231 is a deficient number, since it is larger than the sum of its proper divisors (439282409).
210411214231 is a wasteful number, since it uses less digits than its factorization.
210411214231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138053.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 210411214231 its reverse (132412114012), we get a palindrome (342823328243).
The spelling of 210411214231 in words is "two hundred ten billion, four hundred eleven million, two hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •