Base | Representation |
---|---|
bin | 1010011111111011010100… |
… | …0011001000000110001001 |
3 | 1111212120002100110122120202 |
4 | 2213332311003020012021 |
5 | 3003112310320320131 |
6 | 40315021403301545 |
7 | 2300666350206440 |
oct | 247766503100611 |
9 | 44776070418522 |
10 | 11543614620041 |
11 | 375068a569a39 |
12 | 136529121a8b5 |
13 | 659734452bba |
14 | 2bc9dd03dd57 |
15 | 1504212c2bcb |
hex | a7fb50c8189 |
11543614620041 has 16 divisors (see below), whose sum is σ = 13674493741056. Its totient is φ = 9539467564176.
The previous prime is 11543614620019. The next prime is 11543614620061. The reversal of 11543614620041 is 14002641634511.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11543614620041 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11543614619977 and 11543614620004.
It is not an unprimeable number, because it can be changed into a prime (11543614620061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 261821051 + ... + 261865136.
It is an arithmetic number, because the mean of its divisors is an integer number (854655858816).
Almost surely, 211543614620041 is an apocalyptic number.
It is an amenable number.
11543614620041 is a deficient number, since it is larger than the sum of its proper divisors (2130879121015).
11543614620041 is an equidigital number, since it uses as much as digits as its factorization.
11543614620041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523686308.
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 11543614620041 in words is "eleven trillion, five hundred forty-three billion, six hundred fourteen million, six hundred twenty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •