Base | Representation |
---|---|
bin | 1100010010000000101… |
… | …0101100011101001111 |
3 | 202011121110200121020102 |
4 | 3010200022230131033 |
5 | 11424103211300301 |
6 | 240532345441315 |
7 | 21146414343314 |
oct | 3044012543517 |
9 | 664543617212 |
10 | 210993071951 |
11 | 815330a7932 |
12 | 34a851a023b |
13 | 16b8698c28c |
14 | a2d80aad0b |
15 | 574d5e5b6b |
hex | 31202ac74f |
210993071951 has 4 divisors (see below), whose sum is σ = 212860267392. Its totient is φ = 209125876512.
The previous prime is 210993071833. The next prime is 210993071987. The reversal of 210993071951 is 159170399012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 210993071951 - 222 = 210988877647 is a prime.
It is a super-2 number, since 2×2109930719512 (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 = 210993071896 and 210993071905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210993076951) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 933597551 + ... + 933597776.
It is an arithmetic number, because the mean of its divisors is an integer number (53215066848).
Almost surely, 2210993071951 is an apocalyptic number.
210993071951 is a deficient number, since it is larger than the sum of its proper divisors (1867195441).
210993071951 is a wasteful number, since it uses less digits than its factorization.
210993071951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1867195440.
The product of its (nonzero) digits is 153090, while the sum is 47.
The spelling of 210993071951 in words is "two hundred ten billion, nine hundred ninety-three million, seventy-one thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •