Base | Representation |
---|---|
bin | 10011010010001101… |
… | …10011101000110011 |
3 | 222201112121111011100 |
4 | 21221012303220303 |
5 | 132200422423033 |
6 | 4431203415443 |
7 | 514364552532 |
oct | 115106635063 |
9 | 28645544140 |
10 | 10353326643 |
11 | 4433201600 |
12 | 200b384583 |
13 | c8cc698aa |
14 | 703058319 |
15 | 408e02513 |
hex | 2691b3a33 |
10353326643 has 72 divisors (see below), whose sum is σ = 16963730784. Its totient is φ = 6075717120.
The previous prime is 10353326623. The next prime is 10353326707. The reversal of 10353326643 is 34662335301.
10353326643 is a `hidden beast` number, since 1 + 0 + 3 + 5 + 3 + 3 + 2 + 6 + 643 = 666.
10353326643 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 10353326643 - 26 = 10353326579 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10353326598 and 10353326607.
It is not an unprimeable number, because it can be changed into a prime (10353326603) 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 71 ways as a sum of consecutive naturals, for example, 10596571 + ... + 10597547.
It is an arithmetic number, because the mean of its divisors is an integer number (235607372).
Almost surely, 210353326643 is an apocalyptic number.
10353326643 is a deficient number, since it is larger than the sum of its proper divisors (6610404141).
10353326643 is a wasteful number, since it uses less digits than its factorization.
10353326643 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1305 (or 1291 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 36.
The spelling of 10353326643 in words is "ten billion, three hundred fifty-three million, three hundred twenty-six thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •