Base | Representation |
---|---|
bin | 10011110110000110… |
… | …00011010100110101 |
3 | 1000111112000011011210 |
4 | 21323003003110311 |
5 | 133310002112323 |
6 | 4521115152033 |
7 | 525011221020 |
oct | 117303032465 |
9 | 30445004153 |
10 | 10654332213 |
11 | 4578102538 |
12 | 2094145619 |
13 | 100a42a2b5 |
14 | 7310101b7 |
15 | 42555e293 |
hex | 27b0c3535 |
10654332213 has 32 divisors (see below), whose sum is σ = 17150653440. Its totient is φ = 5747172480.
The previous prime is 10654332167. The next prime is 10654332217. The reversal of 10654332213 is 31223345601.
10654332213 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 10654332213 - 28 = 10654331957 is a prime.
It is a super-2 number, since 2×106543322132 (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 (10654332217) 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 31 ways as a sum of consecutive naturals, for example, 64606 + ... + 159632.
It is an arithmetic number, because the mean of its divisors is an integer number (535957920).
Almost surely, 210654332213 is an apocalyptic number.
It is an amenable number.
10654332213 is a deficient number, since it is larger than the sum of its proper divisors (6496321227).
10654332213 is a wasteful number, since it uses less digits than its factorization.
10654332213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95337.
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 10654332213 its reverse (31223345601), we get a palindrome (41877677814).
The spelling of 10654332213 in words is "ten billion, six hundred fifty-four million, three hundred thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •