Base | Representation |
---|---|
bin | 10011110100011011… |
… | …01110010010001111 |
3 | 1000110112200220110220 |
4 | 21322031232102033 |
5 | 133242412234044 |
6 | 4515455402423 |
7 | 524451334365 |
oct | 117215562217 |
9 | 30415626426 |
10 | 10640352399 |
11 | 4570224276 |
12 | 208b523413 |
13 | 1007574111 |
14 | 72d211635 |
15 | 4241ec019 |
hex | 27a36e48f |
10640352399 has 8 divisors (see below), whose sum is σ = 14223608880. Its totient is φ = 7075332096.
The previous prime is 10640352383. The next prime is 10640352413. The reversal of 10640352399 is 99325304601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10640352399 - 24 = 10640352383 is a prime.
It is a super-3 number, since 3×106403523993 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 10640352399.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10640352379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4557682 + ... + 4560015.
It is an arithmetic number, because the mean of its divisors is an integer number (1777951110).
Almost surely, 210640352399 is an apocalyptic number.
10640352399 is a deficient number, since it is larger than the sum of its proper divisors (3583256481).
10640352399 is an equidigital number, since it uses as much as digits as its factorization.
10640352399 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9118089.
The product of its (nonzero) digits is 174960, while the sum is 42.
The spelling of 10640352399 in words is "ten billion, six hundred forty million, three hundred fifty-two thousand, three hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •