Base | Representation |
---|---|
bin | 1100001111001111110… |
… | …1000111010011101101 |
3 | 202002200202221102012000 |
4 | 3003303331013103231 |
5 | 11421043314030123 |
6 | 240331011202513 |
7 | 21122136454020 |
oct | 3036375072355 |
9 | 662622842160 |
10 | 210251314413 |
11 | 81192427478 |
12 | 348b88a6439 |
13 | 16a990bc3aa |
14 | a2677831b7 |
15 | 5708425b43 |
hex | 30f3f474ed |
210251314413 has 64 divisors (see below), whose sum is σ = 360630336000. Its totient is φ = 118583377920.
The previous prime is 210251314411. The next prime is 210251314423. The reversal of 210251314413 is 314413152012.
210251314413 is a `hidden beast` number, since 2 + 1 + 0 + 2 + 513 + 144 + 1 + 3 = 666.
It is not a de Polignac number, because 210251314413 - 21 = 210251314411 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210251314411) 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 63 ways as a sum of consecutive naturals, for example, 5126613 + ... + 5167461.
It is an arithmetic number, because the mean of its divisors is an integer number (5634849000).
Almost surely, 2210251314413 is an apocalyptic number.
It is an amenable number.
210251314413 is a deficient number, since it is larger than the sum of its proper divisors (150379021587).
210251314413 is a wasteful number, since it uses less digits than its factorization.
210251314413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41219 (or 41213 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 210251314413 its reverse (314413152012), we get a palindrome (524664466425).
The spelling of 210251314413 in words is "two hundred ten billion, two hundred fifty-one million, three hundred fourteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •