Base | Representation |
---|---|
bin | 1001001110000001111100… |
… | …0000110011110010111111 |
3 | 1022220001110002101011222012 |
4 | 2103200133000303302333 |
5 | 2312034321114440130 |
6 | 33320413133241435 |
7 | 2064230315626313 |
oct | 223403700636277 |
9 | 38801402334865 |
10 | 10136643124415 |
11 | 3258a20866915 |
12 | 117867133327b |
13 | 586b5c4133b2 |
14 | 27088a9b7b43 |
15 | 128a260c9995 |
hex | 9381f033cbf |
10136643124415 has 8 divisors (see below), whose sum is σ = 12692840086368. Its totient is φ = 7756735608160.
The previous prime is 10136643124403. The next prime is 10136643124417. The reversal of 10136643124415 is 51442134663101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10136643124415 - 210 = 10136643123391 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10136643124417) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44072361296 + ... + 44072361525.
It is an arithmetic number, because the mean of its divisors is an integer number (1586605010796).
Almost surely, 210136643124415 is an apocalyptic number.
10136643124415 is a deficient number, since it is larger than the sum of its proper divisors (2556196961953).
10136643124415 is an equidigital number, since it uses as much as digits as its factorization.
10136643124415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88144722849.
The product of its (nonzero) digits is 207360, while the sum is 41.
Adding to 10136643124415 its reverse (51442134663101), we get a palindrome (61578777787516).
The spelling of 10136643124415 in words is "ten trillion, one hundred thirty-six billion, six hundred forty-three million, one hundred twenty-four thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •