Base | Representation |
---|---|
bin | 10011110100100001… |
… | …01100101010110101 |
3 | 1000110121011112011220 |
4 | 21322100230222311 |
5 | 133243112212323 |
6 | 4515524220553 |
7 | 524461063035 |
oct | 117220545265 |
9 | 30417145156 |
10 | 10641132213 |
11 | 4570707148 |
12 | 208b83a759 |
13 | 100778804a |
14 | 72d3758c5 |
15 | 4243030e3 |
hex | 27a42cab5 |
10641132213 has 16 divisors (see below), whose sum is σ = 14537909760. Its totient is φ = 6919671024.
The previous prime is 10641132211. The next prime is 10641132217. The reversal of 10641132213 is 31223114601.
It is a happy number.
10641132213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10641132213 - 21 = 10641132211 is a prime.
It is a super-2 number, since 2×106411322132 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10641132211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39520 + ... + 151142.
It is an arithmetic number, because the mean of its divisors is an integer number (908619360).
Almost surely, 210641132213 is an apocalyptic number.
It is an amenable number.
10641132213 is a deficient number, since it is larger than the sum of its proper divisors (3896777547).
10641132213 is a wasteful number, since it uses less digits than its factorization.
10641132213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112408.
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 10641132213 its reverse (31223114601), we get a palindrome (41864246814).
The spelling of 10641132213 in words is "ten billion, six hundred forty-one million, one hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •