Base | Representation |
---|---|
bin | 10011001111000001… |
… | …00001011111101001 |
3 | 222122200011020122012 |
4 | 21213200201133221 |
5 | 132122041414031 |
6 | 4424405005305 |
7 | 513620626523 |
oct | 114740413751 |
9 | 28580136565 |
10 | 10326513641 |
11 | 441a0585a4 |
12 | 20023b3835 |
13 | c8753c402 |
14 | 6dd678a13 |
15 | 4068a7b2b |
hex | 2678217e9 |
10326513641 has 8 divisors (see below), whose sum is σ = 10453969344. Its totient is φ = 10199130480.
The previous prime is 10326513607. The next prime is 10326513671. The reversal of 10326513641 is 14631562301.
10326513641 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10326513641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10326513598 and 10326513607.
It is not an unprimeable number, because it can be changed into a prime (10326513671) 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 7 ways as a sum of consecutive naturals, for example, 303131 + ... + 335471.
It is an arithmetic number, because the mean of its divisors is an integer number (1306746168).
Almost surely, 210326513641 is an apocalyptic number.
It is an amenable number.
10326513641 is a deficient number, since it is larger than the sum of its proper divisors (127455703).
10326513641 is an equidigital number, since it uses as much as digits as its factorization.
10326513641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36271.
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 10326513641 in words is "ten billion, three hundred twenty-six million, five hundred thirteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •