Base | Representation |
---|---|
bin | 1010100000010011000111… |
… | …1110111111001101000111 |
3 | 1111220011120202022211110220 |
4 | 2220010301332333031013 |
5 | 3003213402421414333 |
6 | 40321555505315423 |
7 | 2301313623125502 |
oct | 250046176771507 |
9 | 44804522284426 |
10 | 11550005654343 |
11 | 375336a0a1672 |
12 | 1366575635b73 |
13 | 65a2125413c0 |
14 | 2bd047b5c139 |
15 | 1506973ec8b3 |
hex | a8131fbf347 |
11550005654343 has 32 divisors (see below), whose sum is σ = 16740587297280. Its totient is φ = 7040883864960.
The previous prime is 11550005654339. The next prime is 11550005654357. The reversal of 11550005654343 is 34345650005511.
It is a happy number.
It is not a de Polignac number, because 11550005654343 - 22 = 11550005654339 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11550005654295 and 11550005654304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11550005654323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18495028 + ... + 19109318.
It is an arithmetic number, because the mean of its divisors is an integer number (523143353040).
Almost surely, 211550005654343 is an apocalyptic number.
11550005654343 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11550005654343 is a deficient number, since it is larger than the sum of its proper divisors (5190581642937).
11550005654343 is a wasteful number, since it uses less digits than its factorization.
11550005654343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 618839.
The product of its (nonzero) digits is 540000, while the sum is 42.
Adding to 11550005654343 its reverse (34345650005511), we get a palindrome (45895655659854).
The spelling of 11550005654343 in words is "eleven trillion, five hundred fifty billion, five million, six hundred fifty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •