Base | Representation |
---|---|
bin | 1010101011101011000101… |
… | …0101011001100001001111 |
3 | 1112120211222012220221011102 |
4 | 2222322301111121201033 |
5 | 3014414102413422142 |
6 | 40551434114213315 |
7 | 2321402231504240 |
oct | 252726125314117 |
9 | 45524865827142 |
10 | 11745415764047 |
11 | 3819225aa62a9 |
12 | 139840bb8423b |
13 | 672784972a54 |
14 | 2c86a4414cc7 |
15 | 1557d2929532 |
hex | aaeb155984f |
11745415764047 has 8 divisors (see below), whose sum is σ = 13424737815552. Its totient is φ = 10066445091000.
The previous prime is 11745415764037. The next prime is 11745415764073. The reversal of 11745415764047 is 74046751454711.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11745415764047 - 234 = 11728235894863 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11745415763983 and 11745415764001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11745415764037) 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, 87772979 + ... + 87906692.
It is an arithmetic number, because the mean of its divisors is an integer number (1678092226944).
Almost surely, 211745415764047 is an apocalyptic number.
11745415764047 is a deficient number, since it is larger than the sum of its proper divisors (1679322051505).
11745415764047 is an equidigital number, since it uses as much as digits as its factorization.
11745415764047 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175689229.
The product of its (nonzero) digits is 13171200, while the sum is 56.
The spelling of 11745415764047 in words is "eleven trillion, seven hundred forty-five billion, four hundred fifteen million, seven hundred sixty-four thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •