Base | Representation |
---|---|
bin | 1100010010001000010… |
… | …1010011100010000000 |
3 | 202011200201011120020200 |
4 | 3010202011103202000 |
5 | 11424134423313233 |
6 | 240535454405200 |
7 | 21150254501541 |
oct | 3044205234200 |
9 | 664621146220 |
10 | 211025213568 |
11 | 8154a260354 |
12 | 34a93b00800 |
13 | 16b90533ca0 |
14 | a2dc4764c8 |
15 | 5751344313 |
hex | 3122153880 |
211025213568 has 96 divisors (see below), whose sum is σ = 653958390540. Its totient is φ = 64930830336.
The previous prime is 211025213563. The next prime is 211025213579. The reversal of 211025213568 is 865312520112.
211025213568 is a `hidden beast` number, since 21 + 10 + 2 + 52 + 13 + 568 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 201356817984 + 9668395584 = 448728^2 + 98328^2 .
It is a tau number, because it is divible by the number of its divisors (96).
It is a super-2 number, since 2×2110252135682 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (211025213563) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7030471 + ... + 7060422.
Almost surely, 2211025213568 is an apocalyptic number.
It is an amenable number.
211025213568 is an abundant number, since it is smaller than the sum of its proper divisors (442933176972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211025213568 is a wasteful number, since it uses less digits than its factorization.
211025213568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14090926 (or 14090911 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The spelling of 211025213568 in words is "two hundred eleven billion, twenty-five million, two hundred thirteen thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •