Base | Representation |
---|---|
bin | 1010100101100100110001… |
… | …1101000100010010110111 |
3 | 1112012211112111110220222220 |
4 | 2221121030131010102313 |
5 | 3011210014334412333 |
6 | 40431345453053423 |
7 | 2311003003640154 |
oct | 251311435042267 |
9 | 45184474426886 |
10 | 11640644060343 |
11 | 3788851112621 |
12 | 1380050187273 |
13 | 6659286b83bc |
14 | 2c35a575d22b |
15 | 152bee8318b3 |
hex | a964c7444b7 |
11640644060343 has 8 divisors (see below), whose sum is σ = 15695250418800. Its totient is φ = 7673233537728.
The previous prime is 11640644060293. The next prime is 11640644060351. The reversal of 11640644060343 is 34306044604611.
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 11640644060343 - 233 = 11632054125751 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11640644060295 and 11640644060304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11640644060393) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21798958648 + ... + 21798959181.
It is an arithmetic number, because the mean of its divisors is an integer number (1961906302350).
Almost surely, 211640644060343 is an apocalyptic number.
11640644060343 is a deficient number, since it is larger than the sum of its proper divisors (4054606358457).
11640644060343 is an equidigital number, since it uses as much as digits as its factorization.
11640644060343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43597917921.
The product of its (nonzero) digits is 497664, while the sum is 42.
Adding to 11640644060343 its reverse (34306044604611), we get a palindrome (45946688664954).
The spelling of 11640644060343 in words is "eleven trillion, six hundred forty billion, six hundred forty-four million, sixty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •