Base | Representation |
---|---|
bin | 101111110001011011000000… |
… | …110000000111011001011100 |
3 | 1000112220210021221201111002020 |
4 | 233301123000300013121130 |
5 | 210014322400132240122 |
6 | 2022504352112300140 |
7 | 62153354662355040 |
oct | 5761330060073134 |
9 | 1015823257644066 |
10 | 210104444024412 |
11 | 60a44881270813 |
12 | 1b693795241650 |
13 | 90309c1832382 |
14 | 39c51760ac020 |
15 | 194547344ec5c |
hex | bf16c0c0765c |
210104444024412 has 96 divisors (see below), whose sum is σ = 580553327800320. Its totient is φ = 57864360476160.
The previous prime is 210104444024357. The next prime is 210104444024417. The reversal of 210104444024412 is 214420444401012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210104444024417) 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 31 ways as a sum of consecutive naturals, for example, 69567289 + ... + 72524592.
It is an arithmetic number, because the mean of its divisors is an integer number (6047430497920).
Almost surely, 2210104444024412 is an apocalyptic number.
It is an amenable number.
210104444024412 is an abundant number, since it is smaller than the sum of its proper divisors (370448883775908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210104444024412 is a wasteful number, since it uses less digits than its factorization.
210104444024412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 142092531 (or 142092529 counting only the distinct ones).
The product of its (nonzero) digits is 32768, while the sum is 33.
Adding to 210104444024412 its reverse (214420444401012), we get a palindrome (424524888425424).
The spelling of 210104444024412 in words is "two hundred ten trillion, one hundred four billion, four hundred forty-four million, twenty-four thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •