Base | Representation |
---|---|
bin | 11001011001110… |
… | …10100001100001 |
3 | 112211222122010100 |
4 | 30230322201201 |
5 | 414023210031 |
6 | 33051253013 |
7 | 5165216445 |
oct | 1454724141 |
9 | 484878110 |
10 | 213100641 |
11 | aa320736 |
12 | 5b44a169 |
13 | 351c3270 |
14 | 20432825 |
15 | 13a95de6 |
hex | cb3a861 |
213100641 has 12 divisors (see below), whose sum is σ = 331490068. Its totient is φ = 131138784.
The previous prime is 213100639. The next prime is 213100687. The reversal of 213100641 is 146001312.
It is a happy number.
213100641 is a `hidden beast` number, since 2 + 13 + 10 + 0 + 641 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 58844241 + 154256400 = 7671^2 + 12420^2 .
It is not a de Polignac number, because 213100641 - 21 = 213100639 is a prime.
It is a super-2 number, since 2×2131006412 = 90823766389221762, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (213100631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 910570 + ... + 910803.
Almost surely, 2213100641 is an apocalyptic number.
It is an amenable number.
213100641 is a deficient number, since it is larger than the sum of its proper divisors (118389427).
213100641 is a wasteful number, since it uses less digits than its factorization.
213100641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1821392 (or 1821389 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 213100641 is about 14597.9670159923. The cubic root of 213100641 is about 597.3033062293.
Adding to 213100641 its reverse (146001312), we get a palindrome (359101953).
The spelling of 213100641 in words is "two hundred thirteen million, one hundred thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •