Base | Representation |
---|---|
bin | 1001101011010101101100… |
… | …0110011110001011101110 |
3 | 1101200012010012202101210010 |
4 | 2122311123012132023232 |
5 | 2343312023034242332 |
6 | 34344004555154050 |
7 | 2145504100162245 |
oct | 232653306361356 |
9 | 41605105671703 |
10 | 10640162415342 |
11 | 3432516327709 |
12 | 123a174a45926 |
13 | 5c24946c3225 |
14 | 28adb537b95c |
15 | 136b95b7a9cc |
hex | 9ad5b19e2ee |
10640162415342 has 16 divisors (see below), whose sum is σ = 21280396084992. Its totient is φ = 3546708929400.
The previous prime is 10640162415317. The next prime is 10640162415349. The reversal of 10640162415342 is 24351426104601.
It is a super-2 number, since 2×106401624153422 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10640162415342.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10640162415349) 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, 918784 + ... + 4703667.
It is an arithmetic number, because the mean of its divisors is an integer number (1330024755312).
Almost surely, 210640162415342 is an apocalyptic number.
10640162415342 is an abundant number, since it is smaller than the sum of its proper divisors (10640233669650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10640162415342 is a wasteful number, since it uses less digits than its factorization.
10640162415342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5937863.
The product of its (nonzero) digits is 138240, while the sum is 39.
Adding to 10640162415342 its reverse (24351426104601), we get a palindrome (34991588519943).
The spelling of 10640162415342 in words is "ten trillion, six hundred forty billion, one hundred sixty-two million, four hundred fifteen thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •