Base | Representation |
---|---|
bin | 1100001111111011011… |
… | …1001110101011101011 |
3 | 202010011112022010012121 |
4 | 3003332313032223223 |
5 | 11421432141234011 |
6 | 240401105452111 |
7 | 21126521134216 |
oct | 3037667165353 |
9 | 663145263177 |
10 | 210434321131 |
11 | 812767630a1 |
12 | 3494a041037 |
13 | 16ac7ca69a8 |
14 | a283bc077d |
15 | 5719524e71 |
hex | 30fedceaeb |
210434321131 has 8 divisors (see below), whose sum is σ = 214012537200. Its totient is φ = 206856489600.
The previous prime is 210434321101. The next prime is 210434321159. The reversal of 210434321131 is 131123434012.
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 210434321131 - 25 = 210434321099 is a prime.
It is a super-2 number, since 2×2104343211312 (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 = 210434321096 and 210434321105.
It is not an unprimeable number, because it can be changed into a prime (210434321101) 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, 1142031 + ... + 1313431.
It is an arithmetic number, because the mean of its divisors is an integer number (26751567150).
Almost surely, 2210434321131 is an apocalyptic number.
210434321131 is a deficient number, since it is larger than the sum of its proper divisors (3578216069).
210434321131 is a wasteful number, since it uses less digits than its factorization.
210434321131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192269.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 210434321131 its reverse (131123434012), we get a palindrome (341557755143).
The spelling of 210434321131 in words is "two hundred ten billion, four hundred thirty-four million, three hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •